
Mathematical induction
-
-
problem
Dirisibly yours
Find and explain a short and neat proof that 5^(2n+1) + 11^(2n+1) + 17^(2n+1) is divisible by 33 for every non negative integer n. -
problem
Counting binary ops
How many ways can the terms in an ordered list be combined by repeating a single binary operation. Show that for 4 terms there are 5 cases and find the number of cases for 5 terms and 6 terms. -
problem
Walkabout
A walk is made up of diagonal steps from left to right, starting at the origin and ending on the x-axis. How many paths are there for 4 steps, for 6 steps, for 8 steps? -
problem
One basket or group photo
Libby Jared helped to set up NRICH and this is one of her favourite problems. It's a problem suitable for a wide age range and best tackled practically. -
problem
Golden powers
You add 1 to the golden ratio to get its square. How do you find higher powers? -
problem
Binary squares
If a number N is expressed in binary by using only 'ones,' what can you say about its square (in binary)? -
problem
Growing
Which is larger: (a) 1.000001^{1000000} or 2? (b) 100^{300} or 300! (i.e.factorial 300) -
problem
Overarch 2
Bricks are 20cm long and 10cm high. How high could an arch be built without mortar on a flat horizontal surface, to overhang by 1 metre? How big an overhang is it possible to make like this? -
problem
OK! Now prove it
Make a conjecture about the sum of the squares of the odd positive integers. Can you prove it?