a) A four digit number (in base 10) aabb is a perfect square. Discuss ways of systematically finding this number. (b) Prove that 11^{10}-1 is divisible by 100.

Consider numbers of the form un = 1! + 2! + 3! +...+n!. How many such numbers are perfect squares?

What is the largest number which, when divided into 1905, 2587, 3951, 7020 and 8725 in turn, leaves the same remainder each time?

Details are given of how check codes are constructed (using modulus arithmetic for passports, bank accounts, credit cards, ISBN book numbers, and so on. A list of codes is given and you have to check. . . .

Find the values of n for which 1^n + 8^n - 3^n - 6^n is divisible by 6.

Given any 3 digit number you can use the given digits and name another number which is divisible by 37 (e.g. given 628 you say 628371 is divisible by 37 because you know that 6+3 = 2+7 = 8+1 = 9). . . .

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.

In this article we shall consider how to solve problems such as "Find all integers that leave a remainder of 1 when divided by 2, 3, and 5."

On a "move" a stone is removed from two of the circles and placed in the third circle. Here are five of the ways that 27 stones could be distributed.

This article takes the reader through divisibility tests and how they work. An article to read with pencil and paper to hand.

Suppose an operator types a US Bank check code into a machine and transposes two adjacent digits will the machine pick up every error of this type? Does the same apply to ISBN numbers; will a machine. . . .

Lyndon chose this as one of his favourite problems. It is accessible but needs some careful analysis of what is included and what is not. A systematic approach is really helpful.

You have worked out a secret code with a friend. Every letter in the alphabet can be represented by a binary value.

Three people chose this as a favourite problem. It is the sort of problem that needs thinking time - but once the connection is made it gives access to many similar ideas.

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.

An introduction to the ideas of public key cryptography using small numbers to explain the process. In practice the numbers used are too large to factorise in a reasonable time.

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?

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

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

Find all 3 digit numbers such that by adding the first digit, the square of the second and the cube of the third you get the original number, for example 1 + 3^2 + 5^3 = 135.

The four digits 5, 6, 7 and 8 are put at random in the spaces of the number : 3 _ 1 _ 4 _ 0 _ 9 2 Calculate the probability that the answer will be a multiple of 396.

What can you say about the common difference of an AP where every term is prime?

Here is a Sudoku with a difference! Use information about lowest common multiples to help you solve it.

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.

How many noughts are at the end of these giant numbers?

Take any pair of numbers, say 9 and 14. Take the larger number, fourteen, and count up in 14s. Then divide each of those values by the 9, and look at the remainders.

An example of a simple Public Key code, called the Knapsack Code is described in this article, alongside some information on its origins. A knowledge of modular arithmetic is useful.