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

Euclid's Algorithm and Musical Intervals

Age 16 to 18
Challenge Level Yellow starYellow star
  • Problem
  • Getting Started
  • Student Solutions
  • Teachers' Resources

How many major thirds are there in an octave on a musical scale?

Going back in history, before the discovery of logarithms, some theorists used Euclid's algorithm to find the answer to this question.

A rational approximation ${m\over n}$ for the relationship between 5/4, the musical interval called the major third, and the octave 2/1, is given by $$ \left({5\over 4}\right)^m \approx \left({2\over 1}\right)^n, $$ where $m$ and $n$ are integers. Using Euclid's algorithm show that ${m\over n}={28\over 9}$ gives a first approximation and find three closer rational approximations.


In the articles Euclid's Algorithm and Approximations, Euclid's Algorithm and Continued Fractions you can find out about this method and also that Euclid's algorithm can be used not only for integers but for any numbers.

[See also the problems Tuning and Ratio and Rarity. The set of three problems on mathematics and music was devised by Benjamin Wardaugh who used to be a member of the NRICH team. Benjamin is now doing research into the history of mathematics and music at Oxford University and his article Music and Euclid's Algorithm should help you with this problem.]

You may also like

Good Approximations

Solve quadratic equations and use continued fractions to find rational approximations to irrational numbers.

There's a Limit

Explore the continued fraction: 2+3/(2+3/(2+3/2+...)) What do you notice when successive terms are taken? What happens to the terms if the fraction goes on indefinitely?

Not Continued Fractions

Which rational numbers cannot be written in the form x + 1/(y + 1/z) where x, y and z are integers?

  • 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