A recursive programming Le Monde mathematical puzzle: Given n tokens with 10≤n≤25, Alice and Bob play the following game: the first player draws an integer1≤m≤6 at random. This player can then take 1≤r≤min(2m,n) tokens. The next player is then free to take 1≤s≤min(2r,n-r) tokens. The player taking the last tokens is the winner. There is […]

## Search Results

## Le Monde puzzle [#905]

April 1, 2015## Le Monde puzzle [#904.5]

March 25, 2015About this #904 arithmetics Le Monde mathematical puzzle: Find all plural integers, namely positive integers such that (a) none of their digits is zero and (b) removing their leftmost digit produces a dividing plural integer (with the convention that one digit integers are all plural). a slight modification in the R code allows for a […]

## Le Monde puzzle [#904]

March 25, 2015An arithmetics Le Monde mathematical puzzle: Find all plural integers, namely positive integers such that (a) none of their digits is zero and (b) removing their leftmost digit produces a dividing plural integer (with the convention that one digit integers are all plural). An easy arithmetic puzzle, with no real need for an R code […]

## Le Monde puzzle [#899]

February 8, 2015An arithmetics Le Monde mathematical puzzle: For which n’s are the averages of the first n squared integers integers? Among those, which ones are perfect squares? An easy R code, for instance which produces 333 values which are made of all odd integers that are not multiple of 3. (I could have guessed the exclusion […]