Number theory

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 a(n) and b(n) for n<8. What do you notice about these sequences? (ii) Find a relation between a(p) and b(q). (iii) Prove your conjectures.

What is the remainder when 2^{164}is divided by 7?

Can you produce convincing arguments that a selection of statements about numbers are true?

115^2 = (110 x 120) + 25, that is 13225 895^2 = (890 x 900) + 25, that is 801025 Can you explain what is happening and generalise?

Charlie and Abi put a counter on 42. They wondered if they could visit all the other numbers on their 1-100 board, moving the counter using just these two operations: x2 and -5. What do you think?

All strange numbers are prime. Every one digit prime number is strange and a number of two or more digits is strange if and only if so are the two numbers obtained from it by omitting either its first or its last digit. Find all strange numbers.

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.

Can you guarantee that, for any three numbers you choose, the product of their differences will always be an even number?

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?

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?