Add new comment

Puzzle page

Submitted by plusadmin on 1 March, 2004
March 2004

Breaking up can be sweet...

chocolate

I have just bought a beautiful block of chocolate. It is a normal rectangular-shaped block with 5 rows, and 4 pieces of chocolate to a row, making 20 pieces of chocolate ready for the eating. I want to eat all of it right now, but I want to savour each piece.

What is the least number of clean snaps necessary to break the block of chocolate into the 20 individual pieces?

What about for a block with n rows of m pieces?


If you are stumped by last issue's puzzle, here is the solution.

For some challenging mathematical puzzles, see the NRICH puzzles from this month or last month.

Solution link
Breaking up can be sweet solution
About text formats

Filtered HTML

  • Web page addresses and email addresses turn into links automatically.
  • Allowed HTML tags: <a href hreflang> <em> <strong> <cite> <code> <ul type> <ol start type> <li> <dl> <dt> <dd>
  • Lines and paragraphs break automatically.
  • Maths in a minute

    Want facts and want them fast? Our Maths in a minute series explores key mathematical concepts in just a few words.

  • Climate change: How can maths help?

    As COP28, the 2023 United Nations Climate Change Conference, kicks off we look at how maths can help understand the climate crisis.

  • The travelling salesman
    map

    How do you create dramatic film out of mathematics? We find out with writer and director Timothy Lanzone.

  • Disease modelling for beginners

    Mathematics plays a central role in understanding how infectious diseases spread. This collection of articles looks at some basic concepts in epidemiology to help you understand this fascinating and important field, and set you up for further study.

  • Maths in a minute: Conditional probability

    Find out why the formula we use to work out conditional probabilities is true!

  • A disappearing number
    scene from play
    We talk about a play that explores the fascinating mathematical collaboration between the mathematicians GH Hardy and Srinivasa Ramanujan.