Game involving taking candy from piles
Source:
April 19, 2013
floor function
Problem Statement
There are two piles with and candies. Two students alternate taking candies from one of the piles. Each time the number of candies taken from a pile must be a multiple of the number of candies in the other pile. Which student can always assure taking the last candy from one of the piles?