Modular arithmetic
-
-
problemPurr-fection
Age16 to 18Challenge level
What is the smallest perfect square that ends with the four digits 9009? -
problemIt must be 2000
Age7 to 11Challenge level
Here are many ideas for you to investigate - all linked with the number 2000. -
articleThe Chinese remainder theorem
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."
-
articleAn introduction to modular arithmetic
An introduction to the notation and uses of modular arithmetic -
articleThe knapsack problem and public key cryptography
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. -
articleLatin squares
A Latin square of order n is an array of n symbols in which each symbol occurs exactly once in each row and exactly once in each column. -
articleModulus arithmetic and a solution to dirisibly yours
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. -
-
articleModulus arithmetic and a solution to differences
Peter Zimmerman, a Year 13 student at Mill Hill County High School in Barnet, London wrote this account of modulus arithmetic.