Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Em'power'ed:

Filter by: Content type:
Stage:
Challenge level:

There are 185 results

Broad Topics > Using, Applying and Reasoning about Mathematics > Mathematical reasoning & proof

Plus or Minus

Stage: 5 Challenge Level:

Make and prove a conjecture about the value of the product of the Fibonacci numbers $F_{n+1}F_{n-1}$.

A Biggy

Stage: 4 Challenge Level:

Find the smallest positive integer N such that N/2 is a perfect cube, N/3 is a perfect fifth power and N/5 is a perfect seventh power.

Common Divisor

Stage: 4 Challenge Level:

Find the largest integer which divides every member of the following sequence: 1^5-1, 2^5-2, 3^5-3, ... n^5-n.

Sixational

Stage: 4 and 5 Challenge Level:

The nth term of a sequence is given by the formula n^3 + 11n . Find the first four terms of the sequence given by this formula and the first term of the sequence which is bigger than one million. . . .

How Many Solutions?

Stage: 5 Challenge Level:

Find all the solutions to the this equation.

Sums of Squares and Sums of Cubes

Stage: 5

An account of methods for finding whether or not a number can be written as the sum of two or more squares or as the sum of two or more cubes.

On the Importance of Pedantry

Stage: 3, 4 and 5

A introduction to how patterns can be deceiving, and what is and is not a proof.

Big, Bigger, Biggest

Stage: 5 Challenge Level:

Which is the biggest and which the smallest of $2000^{2002}, 2001^{2001} \text{and } 2002^{2000}$?

Stage: 3 and 4 Challenge Level:

Powers of numbers behave in surprising ways. Take a look at some of these and try to explain why they are true.

What Numbers Can We Make Now?

Stage: 3 and 4 Challenge Level:

Imagine we have four bags containing numbers from a sequence. What numbers can we make now?

DOTS Division

Stage: 4 Challenge Level:

Take any pair of two digit numbers x=ab and y=cd where, without loss of generality, ab > cd . Form two 4 digit numbers r=abcd and s=cdab and calculate: {r^2 - s^2} /{x^2 - y^2}.

For What?

Stage: 4 Challenge Level:

Prove that if the integer n is divisible by 4 then it can be written as the difference of two squares.

The Root Cause

Stage: 5 Challenge Level:

Prove that if a is a natural number and the square root of a is rational, then it is a square number (an integer n^2 for some integer n.)

N000ughty Thoughts

Stage: 4 Challenge Level:

Factorial one hundred (written 100!) has 24 noughts when written in full and that 1000! has 249 noughts? Convince yourself that the above is true. Perhaps your methodology will help you find the. . . .

Polite Numbers

Stage: 5 Challenge Level:

A polite number can be written as the sum of two or more consecutive positive integers. Find the consecutive sums giving the polite numbers 544 and 424. What characterizes impolite numbers?

Why 24?

Stage: 4 Challenge Level:

Take any prime number greater than 3 , square it and subtract one. Working on the building blocks will help you to explain what is special about your results.

Number Rules - OK

Stage: 4 Challenge Level:

Can you convince me of each of the following: If a square number is multiplied by a square number the product is ALWAYS a square number...

Square Pair Circles

Stage: 5 Challenge Level:

Investigate the number of points with integer coordinates on circles with centres at the origin for which the square of the radius is a power of 5.

Perfectly Square

Stage: 4 Challenge Level:

The sums of the squares of three related numbers is also a perfect square - can you explain why?

Modulus Arithmetic and a Solution to Dirisibly Yours

Stage: 5

Peter Zimmerman from Mill Hill County High School in Barnet, London gives a neat proof that: 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n.

More Sums of Squares

Stage: 5

Tom writes about expressing numbers as the sums of three squares.

Telescoping Functions

Stage: 5

Take a complicated fraction with the product of five quartics top and bottom and reduce this to a whole number. This is a numerical example involving some clever algebra.

Ordered Sums

Stage: 4 Challenge Level:

Let a(n) be the number of ways of expressing the integer n as an ordered sum of 1's and 2's. Let b(n) be the number of ways of expressing n as an ordered sum of integers greater than 1. (i) Calculate. . . .

Golden Eggs

Stage: 5 Challenge Level:

Find a connection between the shape of a special ellipse and an infinite string of nested square roots.

Stage: 5 Challenge Level:

Find all real solutions of the equation (x^2-7x+11)^(x^2-11x+30) = 1.

Rational Roots

Stage: 5 Challenge Level:

Given that a, b and c are natural numbers show that if sqrt a+sqrt b is rational then it is a natural number. Extend this to 3 variables.

Euclid's Algorithm II

Stage: 5

We continue the discussion given in Euclid's Algorithm I, and here we shall discover when an equation of the form ax+by=c has no solutions, and when it has infinitely many solutions.

Impossible Sandwiches

Stage: 3, 4 and 5

In this 7-sandwich: 7 1 3 1 6 4 3 5 7 2 4 6 2 5 there are 7 numbers between the 7s, 6 between the 6s etc. The article shows which values of n can make n-sandwiches and which cannot.

The Triangle Game

Stage: 3 and 4 Challenge Level:

Can you discover whether this is a fair game?

Continued Fractions II

Stage: 5

In this article we show that every whole number can be written as a continued fraction of the form k/(1+k/(1+k/...)).

Euler's Squares

Stage: 4 Challenge Level:

Euler found four whole numbers such that the sum of any two of the numbers is a perfect square. Three of the numbers that he found are a = 18530, b=65570, c=45986. Find the fourth number, x. You. . . .

Transitivity

Stage: 5

Suppose A always beats B and B always beats C, then would you expect A to beat C? Not always! What seems obvious is not always true. Results always need to be proved in mathematics.

Pythagorean Golden Means

Stage: 5 Challenge Level:

Show that the arithmetic mean, geometric mean and harmonic mean of a and b can be the lengths of the sides of a right-angles triangle if and only if a = bx^3, where x is the Golden Ratio.

Proofs with Pictures

Stage: 5

Some diagrammatic 'proofs' of algebraic identities and inequalities.

Euler's Formula and Topology

Stage: 5

Here is a proof of Euler's formula in the plane and on a sphere together with projects to explore cases of the formula for a polygon with holes, for the torus and other solids with holes and the. . . .

Stage: 5 Short Challenge Level:

Can you work out where the blue-and-red brick roads end?

Composite Notions

Stage: 4 Challenge Level:

A composite number is one that is neither prime nor 1. Show that 10201 is composite in any base.

Pareq Exists

Stage: 4 Challenge Level:

Prove that, given any three parallel lines, an equilateral triangle always exists with one vertex on each of the three lines.

Without Calculus

Stage: 5 Challenge Level:

Given that u>0 and v>0 find the smallest possible value of 1/u + 1/v given that u + v = 5 by different methods.

Mediant

Stage: 4 Challenge Level:

If you take two tests and get a marks out of a maximum b in the first and c marks out of d in the second, does the mediant (a+c)/(b+d)lie between the results for the two tests separately.

A Computer Program to Find Magic Squares

Stage: 5

This follows up the 'magic Squares for Special Occasions' article which tells you you to create a 4by4 magicsquare with a special date on the top line using no negative numbers and no repeats.

Mouhefanggai

Stage: 4

Imagine two identical cylindrical pipes meeting at right angles and think about the shape of the space which belongs to both pipes. Early Chinese mathematicians call this shape the mouhefanggai.

Diophantine N-tuples

Stage: 4 Challenge Level:

Take any whole number q. Calculate q^2 - 1. Factorize q^2-1 to give two factors a and b (not necessarily q+1 and q-1). Put c = a + b + 2q . Then you will find that ab+1 , bc+1 and ca+1 are all. . . .

Modulus Arithmetic and a Solution to Differences

Stage: 5

Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.

Whole Number Dynamics II

Stage: 4 and 5

This article extends the discussions in "Whole number dynamics I". Continuing the proof that, for all starting points, the Happy Number sequence goes into a loop or homes in on a fixed point.

Whole Number Dynamics III

Stage: 4 and 5

In this third of five articles we prove that whatever whole number we start with for the Happy Number sequence we will always end up with some set of numbers being repeated over and over again.

Zig Zag

Stage: 4 Challenge Level:

Four identical right angled triangles are drawn on the sides of a square. Two face out, two face in. Why do the four vertices marked with dots lie on one line?

Whole Number Dynamics I

Stage: 4 and 5

The first of five articles concentrating on whole number dynamics, ideas of general dynamical systems are introduced and seen in concrete cases.

Basic Rhythms

Stage: 5 Challenge Level:

Explore a number pattern which has the same symmetries in different bases.