You may also like

problem icon

Double Time

Crack this code which depends on taking pairs of letters and using two simultaneous relations and modulus arithmetic to encode the message.

problem icon

Modular Fractions

We only need 7 numbers for modulus (or clock) arithmetic mod 7 including working with fractions. Explore how to divide numbers and write fractions in modulus arithemtic.

problem icon

Purr-fection

What is the smallest perfect square that ends with the four digits 9009?

Dirisibly Yours

Age 16 to 18 Challenge Level:

We wonder who can find and explain the shortest and neatest proof that

$5^{2n+1} + 11^{2n+1} + 17^{2n+1}$

is divisible by 33 for every non negative integer n .


The NRICH Project aims to enrich the mathematical experiences of all learners. To support this aim, members of the NRICH team work in a wide range of capacities, including providing professional development for teachers wishing to embed rich mathematical tasks into everyday classroom practice.
Copyright © 1997 - 2019. University of Cambridge. All rights reserved.
NRICH is part of the family of activities in the Millennium Mathematics Project.