Aina the Algebraist buying tickets
Source: Finland 2013, Problem 2
May 2, 2013
inequalitiesalgorithmnumber theoryEuclidean algorithmgreatest common divisorcombinatorics unsolvedcombinatorics
Problem Statement
In a particular European city, there are only day tickets and day tickets to the public transport. The former costs euro and the latter costs euro. Aina the Algebraist decides to buy at once those tickets that she can travel by the public transport the whole three year (2014-2016, 1096 days) visiting in the city. What is the cheapest solution?