A ribbon comprises a line of squares numbered sequentially from 0 to n. A marker can initially be placed on any square. After positioning such a marker, it may be repositioned by moving it p squares to the right or q squares to the left, provided that one does not fall off the ribbon. The numbers p and q are mutually co-prime.
Show that n = p + q – 2 is the smallest value for n which permits all squares to be visited after a successive number of moves.
Question
Guest
A ribbon comprises a line of squares numbered sequentially from 0 to n. A marker can initially be placed on any square. After positioning such a marker, it may be repositioned by moving it p squares to the right or q squares to the left, provided that one does not fall off the ribbon. The numbers p and q are mutually co-prime.
Show that n = p + q – 2 is the smallest value for n which permits all squares to be visited after a successive number of moves.
Edited by jerbilLink to comment
Share on other sites
2 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.