Skip to content

Challenge 312: Circle Time

Thanks to Thomas, Y12, for supplying this problem.

n chairs are arranged in a circle, and each is numbered with one of the integers from 0 to n - 1 inclusive, but not necessarily in numerical order. At 12 noon, n children arrive, and one child sits on each chair. At the end of every minute that passes after they first sit down, every child moves k chairs to their left, where k is the number of the chair they are sitting on. Given that no two children ever end up sitting on the same chair, prove that eventually there will be a time when every child is sitting in the chair they had at the start.

Submit your solution

Please do send in your solution to this problem to  weeklymaths@kcl.ac.uk  You can scan or photograph your written work, or type your solutions. If this is your first weekly maths challenge solution, please include your year group and the name of the school you attend. We'll be happy to provide feedback on your solution, assuming that you are in year 11 or below. If you are older than this, we hope you enjoy trying the problems and reviewing your solutions against those we publish on the website.

 

Connect with