This challenge encourages you to explore dividing a three-digit number by a single-digit number.

Can you order the digits from 1-3 to make a number which is divisible by 3 so when the last digit is removed it becomes a 2-figure number divisible by 2, and so on?

Mathematicians are always looking for efficient methods for solving problems. How efficient can you be?

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

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

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.

Ben passed a third of his counters to Jack, Jack passed a quarter of his counters to Emma and Emma passed a fifth of her counters to Ben. After this they all had the same number of counters.

Yasmin and Zach have some bears to share. Which numbers of bears can they share so that there are none left over?

Whenever a monkey has peaches, he always keeps a fraction of them each day, gives the rest away, and then eats one. How long could he make his peaches last for?

Can you show that 1^99 + 2^99 + 3^99 + 4^99 + 5^99 is divisible by 5?

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?

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.

I'm thinking of a number. When my number is divided by 5 the remainder is 4. When my number is divided by 3 the remainder is 2. Can you find my number?

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

Play the divisibility game to create numbers in which the first two digits make a number divisible by 2, the first three digits make a number divisible by 3...

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.

In a square in which the houses are evenly spaced, numbers 3 and 10 are opposite each other. What is the smallest and what is the largest possible number of houses in the square?

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

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

Take any four digit number. Move the first digit to the end and move the rest along. Now add your two numbers. Did you get a multiple of 11?

Do you know a quick way to check if a number is a multiple of two? How about three, four or six?

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.

Is there an efficient way to work out how many factors a large number has?

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

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

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

When Charlie asked his grandmother how old she is, he didn't get a straightforward reply! Can you work out how old she is?

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

The flow chart requires two numbers, M and N. Select several values for M and try to establish what the flow chart does.

In this article for teachers, Bernard Bagnall describes how to find digital roots and suggests that they can be worth exploring when confronted by a sequence of numbers.

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

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

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.

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

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

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

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.

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.

A three digit number abc is always divisible by 7 when 2a+3b+c is divisible by 7. Why?

Think of any three-digit number. Repeat the digits. The 6-digit number that you end up with is divisible by 91. Is this a coincidence?

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.

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.

What is the remainder when 2^2002 is divided by 7? What happens with different powers of 2?

How many numbers less than 1000 are NOT divisible by either: a) 2 or 5; or b) 2, 5 or 7?

6! = 6 x 5 x 4 x 3 x 2 x 1. The highest power of 2 that divides exactly into 6! is 4 since (6!) / (2^4 ) = 45. What is the highest power of two that divides exactly into 100!?

The number 8888...88M9999...99 is divisible by 7 and it starts with the digit 8 repeated 50 times and ends with the digit 9 repeated 50 times. What is the value of the digit M?