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

Construct-o-straws

Age 7 to 11
Challenge Level Yellow starYellow star
  • Problem
  • Student Solutions

Nico and Daniel from Lower Heath CE Primary School submitted the following solution:

There are 14 ways to go from one vertex to another. Our key was B=back, F=forwards, R=right, L=left, D=down and U=up.

Part 1
1.B,R,D
2.R,B,D
3.D,R,B
4.D,B,R
5.R,D,B
6.B,D,R
7.B,D,F,R,B
8.R,D,L,B,R
9.D,B,U,R,D
10.D,R,U,R,D
11.R,B,L,F,D,R,B
12.R,B,L,F,D,B,R
13.B,R,F,L,D,R,B
14.B,R,F,L,D,B,R

Notice how they worked methodically and recorded their results in a systematic way. Can you see how the results would be different if we were to impose more rules, for instance only being allowed to visit each vertex once? If there is no limit to how many times you can visit each vertex, then there would be plenty more routes that could go on forever! Nico and Daniel also tackled the second half of the problem:

Part 2 Here is a picture of our model:

Nico and Daniel's solution

Part 3 As more threads are attached it will be harder to add more threads and it will look more complicated.

Part 4 The threads make a shape like a 3D star.

Part 5 We think that when we spin the cube it will look like there is a cube in the middle. We were right.

Excellent work, thank you for sending it in to us and well done for cracking this tough nut!


You may also like

Matchsticks

Reasoning about the number of matches needed to build squares that share their sides.

Little Boxes

How many different cuboids can you make when you use four CDs or DVDs? How about using five, then six?

Two Squared

What happens to the area of a square if you double the length of the sides? Try the same thing with rectangles, diamonds and other shapes. How do the four smaller ones fit into the larger one?

  • 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