Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Whole Numbers Only:

Filter by: Content type:
Stage:
Challenge level: Challenge Level:1 Challenge Level:2 Challenge Level:3

There are 179 results

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

problem icon

Cycle It

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Carry out cyclic permutations of nine digit numbers containing the digits from 1 to 9 (until you get back to the first number). Prove that whatever number you choose, they will add to the same total.

problem icon

Adding All Nine

Stage: 3 Challenge Level: Challenge Level:1

Make a set of numbers that use all the digits from 1 to 9, once and once only. Add them up. The result is divisible by 9. Add each of the digits in the new number. What is their sum? Now try some. . . .

problem icon

Unit Fractions

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Consider the equation 1/a + 1/b + 1/c = 1 where a, b and c are natural numbers and 0 < a < b < c. Prove that there is only one set of values which satisfy this equation.

problem icon

Never Prime

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

If a two digit number has its digits reversed and the smaller of the two numbers is subtracted from the larger, prove the difference can never be prime.

problem icon

Number Rules - OK

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

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...

problem icon

Our Ages

Stage: 4 Challenge Level: Challenge Level:1

I am exactly n times my daughter's age. In m years I shall be exactly (n-1) times her age. In m2 years I shall be exactly (n-2) times her age. After that I shall never again be an exact multiple of. . . .

problem icon

One O Five

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

You can work out the number someone else is thinking of as follows. Ask a friend to think of any natural number less than 100. Then ask them to tell you the remainders when this number is divided by. . . .

problem icon

Aba

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

In the following sum the letters A, B, C, D, E and F stand for six distinct digits. Find all the ways of replacing the letters with digits so that the arithmetic is correct.

problem icon

Even So

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Find some triples of whole numbers a, b and c such that a^2 + b^2 + c^2 is a multiple of 4. Is it necessarily the case that a, b and c must all be even? If so, can you explain why?

problem icon

DOTS Division

Stage: 4 Challenge Level: Challenge Level:1

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}.

problem icon

N000ughty Thoughts

Stage: 4 Challenge Level: Challenge Level:1

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. . . .

problem icon

Gift of Gems

Stage: 4 Challenge Level: Challenge Level:1

Four jewellers possessing respectively eight rubies, ten saphires, a hundred pearls and five diamonds, presented, each from his own stock, one apiece to the rest in token of regard; and they. . . .

problem icon

Leonardo's Problem

Stage: 4 and 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

A, B & C own a half, a third and a sixth of a coin collection. Each grab some coins, return some, then share equally what they had put back, finishing with their own share. How rich are they?

problem icon

Tis Unique

Stage: 3 Challenge Level: Challenge Level:1

This addition sum uses all ten digits 0, 1, 2...9 exactly once. Find the sum and show that the one you give is the only possibility.

problem icon

Not Necessarily in That Order

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Baker, Cooper, Jones and Smith are four people whose occupations are teacher, welder, mechanic and programmer, but not necessarily in that order. What is each person’s occupation?

problem icon

Cross-country Race

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Eight children enter the autumn cross-country race at school. How many possible ways could they come in at first, second and third places?

problem icon

Common Divisor

Stage: 4 Challenge Level: Challenge Level:1

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

problem icon

For What?

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

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

problem icon

Sixational

Stage: 4 and 5 Challenge Level: Challenge Level:1

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. . . .

problem icon

Go Forth and Generalise

Stage: 3

Spotting patterns can be an important first step - explaining why it is appropriate to generalise is the next step, and often the most interesting and important.

problem icon

A Chordingly

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Find the area of the annulus in terms of the length of the chord which is tangent to the inner circle.

problem icon

Elevenses

Stage: 3 Challenge Level: Challenge Level:1

How many pairs of numbers can you find that add up to a multiple of 11? Do you notice anything interesting about your results?

problem icon

Power Mad!

Stage: 3 and 4 Challenge Level: Challenge Level:2 Challenge Level:2

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

problem icon

A Long Time at the Till

Stage: 4 and 5 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

Try to solve this very difficult problem and then study our two suggested solutions. How would you use your knowledge to try to solve variants on the original problem?

problem icon

Cyclic Quadrilaterals

Stage: 3 Challenge Level: Challenge Level:1

What can you say about the angles on opposite vertices of any cyclic quadrilateral? Working on the building blocks will give you insights that may help you to explain what is special about them.

problem icon

Paradoxes

Stage: 2 and 3

A paradox is a statement that seems to be both untrue and true at the same time. This article looks at a few examples and challenges you to investigate them for yourself.

problem icon

Children at Large

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

There are four children in a family, two girls, Kate and Sally, and two boys, Tom and Ben. How old are the children?

problem icon

Reverse to Order

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

Take any two digit number, for example 58. What do you have to do to reverse the order of the digits? Can you find a rule for reversing the order of digits for any two digit number?

problem icon

Always Perfect

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Show that if you add 1 to the product of four consecutive numbers the answer is ALWAYS a perfect square.

problem icon

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.

problem icon

Whole Number Dynamics IV

Stage: 4 and 5

Start with any whole number N, write N as a multiple of 10 plus a remainder R and produce a new whole number N'. Repeat. What happens?

problem icon

Composite Notions

Stage: 4 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

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

problem icon

A Biggy

Stage: 4 Challenge Level: Challenge Level:1

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.

problem icon

Mod 3

Stage: 4 Challenge Level: Challenge Level:1

Prove that if a^2+b^2 is a multiple of 3 then both a and b are multiples of 3.

problem icon

More Marbles

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

I start with a red, a blue, a green and a yellow marble. I can trade any of my marbles for three others, one of each colour. Can I end up with exactly two marbles of each colour?

problem icon

Diophantine N-tuples

Stage: 4 Challenge Level: Challenge Level:1

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. . . .

problem icon

Euler's Squares

Stage: 4 Challenge Level: Challenge Level:1

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. . . .

problem icon

Marbles

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

I start with a red, a green and a blue marble. I can trade any of my marbles for two others, one of each colour. Can I end up with five more blue marbles than red after a number of such trades?

problem icon

Pyramids

Stage: 3 Challenge Level: Challenge Level:1

What are the missing numbers in the pyramids?

problem icon

Mediant

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

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.

problem icon

Knight Defeated

Stage: 4 Challenge Level: Challenge Level:1

The knight's move on a chess board is 2 steps in one direction and one step in the other direction. Prove that a knight cannot visit every square on the board once and only (a tour) on a 2 by n board. . . .

problem icon

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.

problem icon

The Triangle Game

Stage: 3 and 4 Challenge Level: Challenge Level:1

Can you discover whether this is a fair game?

problem icon

Magic Squares II

Stage: 4 and 5

An article which gives an account of some properties of magic squares.

problem icon

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.

problem icon

Tree Graphs

Stage: 4 Challenge Level: Challenge Level:1

A connected graph is a graph in which we can get from any vertex to any other by travelling along the edges. A tree is a connected graph with no closed circuits (or loops. Prove that every tree. . . .

problem icon

Road Maker

Stage: 4 and 5 Challenge Level: Challenge Level:1

Which of these roads will satisfy a Munchkin builder?

problem icon

Coins on a Plate

Stage: 3 Challenge Level: Challenge Level:1

Points A, B and C are the centres of three circles, each one of which touches the other two. Prove that the perimeter of the triangle ABC is equal to the diameter of the largest circle.

problem icon

Iff

Stage: 4 Challenge Level: Challenge Level:2 Challenge Level:2

Prove that if n is a triangular number then 8n+1 is a square number. Prove, conversely, that if 8n+1 is a square number then n is a triangular number.

problem icon

Chocolate Maths

Stage: 3 Challenge Level: Challenge Level:1

Pick the number of times a week that you eat chocolate. This number must be more than one but less than ten. Multiply this number by 2. Add 5 (for Sunday). Multiply by 50... Can you explain why it. . . .