Skip over navigation
Cambridge University Faculty of Mathematics NRich logo
menu search
  • Teachers expand_more
    • Early years
    • Primary
    • Secondary
    • Post-16
    • Events
    • Professional development
  • Students expand_more
    • Primary
    • Secondary
    • Post-16
  • Parents expand_more
    • Early Years
    • Primary
    • Secondary
    • Post-16
  • Problem-Solving Schools
  • About NRICH expand_more
    • About us
    • Impact stories
    • Support us
    • Our funders
    • Contact us
  • search

Or search by topic

Number and algebra

  • The Number System and Place Value
  • Calculations and Numerical Methods
  • Fractions, Decimals, Percentages, Ratio and Proportion
  • Properties of Numbers
  • Patterns, Sequences and Structure
  • Algebraic expressions, equations and formulae
  • Coordinates, Functions and Graphs

Geometry and measure

  • Angles, Polygons, and Geometrical Proof
  • 3D Geometry, Shape and Space
  • Measuring and calculating with units
  • Transformations and constructions
  • Pythagoras and Trigonometry
  • Vectors and Matrices

Probability and statistics

  • Handling, Processing and Representing Data
  • Probability

Working mathematically

  • Thinking mathematically
  • Developing positive attitudes
  • Cross-curricular contexts

Advanced mathematics

  • Decision Mathematics and Combinatorics
  • Advanced Probability and Statistics
  • Mechanics
  • Calculus

For younger learners

  • Early Years Foundation Stage

Euromaths

Age 11 to 14
Challenge Level Yellow star
  • Problem
  • Student Solutions

Sarah Dunn, Madras College, St Andrew's, Scotland and Soh Yong Sheng, Raffles Institution, Singapore both solved this in the same way. You write the word EUROMATHS by starting at the top left hand corner and taking the next letter by stepping one step down or one step to the right in this array.

E
0
U
1
R
1
O
1
M
1
U
1
R
2
O
3
M
4
A
5
R
1
O
3
M
6
A
10
T
15
O
1
M
4
A
10
T
20
H
35
M
1
A
5
T
15
H
35
S
70

We draw a grid denoting the number of moves possible to reach each place. The number of possible routes are calculated by adding the number of the gridplace on the left and top, and if it is on the extreme left or top then there is only 1 route to get there. The number added will be correct as the square can only be accessed through these squares. There are altogether 70 possible ways.

Can you generalise this result to a 6 by 6 square, or a 7 by 7 square ... or an n by n square? Have you seen this pattern before? You may like to try a 6 by 6 array written in a slightly different formation.

M
A A
T T T
H H H H
E E E E E
M M M M M M
A A A A A
T T T T
I I I
C C
S

You may also like

Greetings

From a group of any 4 students in a class of 30, each has exchanged Christmas cards with the other three. Show that some students have exchanged cards with all the other students in the class. How many such students are there?

Writ Large

Suppose you had to begin the never ending task of writing out the natural numbers: 1, 2, 3, 4, 5.... and so on. What would be the 1000th digit you would write down.

Mathland Election

A political commentator summed up an election result. Given that there were just four candidates and that the figures quoted were exact find the number of votes polled for each candidate.

  • Tech help
  • Accessibility Statement
  • Sign up to our newsletter
  • Twitter X logo

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.

NRICH is part of the family of activities in the Millennium Mathematics Project.

University of Cambridge logo NRICH logo