Least amount of money
Source: Centroamerican 2012, Problem 5
June 20, 2012
inductionnumber theory unsolvednumber theory
Problem Statement
Alexander and Louise are a pair of burglars. Every morning, Louise steals one third of Alexander's money, but feels remorse later in the afternoon and gives him half of all the money she has. If Louise has no money at the beginning and starts stealing on the first day, what is the least positive integer amount of money Alexander must have so that at the end of the 2012th day they both have an integer amount of money?