Search by Topic

Resources tagged with Mathematical reasoning & proof similar to Nine in a Line:

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

Take Three from Five

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

Caroline and James pick sets of five numbers. Charlie chooses three of them that add together to make a multiple of three. Can they stop him?

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

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

What Numbers Can We Make?

Stage: 3 Challenge Level: Challenge Level:1

Imagine we have four bags containing a large number of 1s, 4s, 7s and 10s. What numbers can we make?

problem icon

What Numbers Can We Make Now?

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

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

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

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

Advent Calendar 2011 - Secondary

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

Advent Calendar 2011 - a mathematical activity for each day during the run-up to Christmas.

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

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

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

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

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

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

Prime AP

Stage: 4 Challenge Level: Challenge Level:1

Show that if three prime numbers, all greater than 3, form an arithmetic progression then the common difference is divisible by 6. What if one of the terms is 3?

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

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

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

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

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

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

The Great Weights Puzzle

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

You have twelve weights, one of which is different from the rest. Using just 3 weighings, can you identify which weight is the odd one out, and whether it is heavier or lighter than the rest?

problem icon

Pyramids

Stage: 3 Challenge Level: Challenge Level:1

What are the missing numbers in the pyramids?

problem icon

Hockey

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

After some matches were played, most of the information in the table containing the results of the games was accidentally deleted. What was the score in each match played?

problem icon

Pattern of Islands

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

In how many distinct ways can six islands be joined by bridges so that each island can be reached from every other island...

problem icon

Dalmatians

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

Investigate the sequences obtained by starting with any positive 2 digit number (10a+b) and repeatedly using the rule 10a+b maps to 10b-a to get the next number in the sequence.

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

Long Short

Stage: 4 Challenge Level: Challenge Level:1

A quadrilateral inscribed in a unit circle has sides of lengths s1, s2, s3 and s4 where s1 ≤ s2 ≤ s3 ≤ s4. Find a quadrilateral of this type for which s1= sqrt2 and show s1 cannot. . . .

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

Janine's Conjecture

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

Janine noticed, while studying some cube numbers, that if you take three consecutive whole numbers and multiply them together and then add the middle number of the three, you get the middle number. . . .

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

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

Tessellating Hexagons

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

Which hexagons tessellate?

problem icon

Con Tricks

Stage: 3

Here are some examples of 'cons', and see if you can figure out where the trick is.

problem icon

Some Circuits in Graph or Network Theory

Stage: 4 and 5

Eulerian and Hamiltonian circuits are defined with some simple examples and a couple of puzzles to illustrate Hamiltonian circuits.

problem icon

Concrete Wheel

Stage: 3 Challenge Level: Challenge Level:1

A huge wheel is rolling past your window. What do you see?

problem icon

Tourism

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

If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.

problem icon

Natural Sum

Stage: 4 Challenge Level: Challenge Level:1

The picture illustrates the sum 1 + 2 + 3 + 4 = (4 x 5)/2. Prove the general formula for the sum of the first n natural numbers and the formula for the sum of the cubes of the first n natural. . . .

problem icon

Clocked

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

Is it possible to rearrange the numbers 1,2......12 around a clock face in such a way that every two numbers in adjacent positions differ by any of 3, 4 or 5 hours?

problem icon

Top-heavy Pyramids

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

Use the numbers in the box below to make the base of a top-heavy pyramid whose top number is 200.

problem icon

Ratty

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

If you know the sizes of the angles marked with coloured dots in this diagram which angles can you find by calculation?

problem icon

Pareq Exists

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

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

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

Unit Interval

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

Take any two numbers between 0 and 1. Prove that the sum of the numbers is always less than one plus their product?

problem icon

Magic Squares II

Stage: 4 and 5

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

problem icon

The Pillar of Chios

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

Semicircles are drawn on the sides of a rectangle ABCD. A circle passing through points ABCD carves out four crescent-shaped regions. Prove that the sum of the areas of the four crescents is equal to. . . .

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

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

Königsberg

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

Can you cross each of the seven bridges that join the north and south of the river to the two islands, once and once only, without retracing your steps?

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