In a particular European city, there are only 7 day tickets and 30 day tickets to the public transport. The former costs 7.03 euro and the latter costs 30 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? inequalitiesalgorithmnumber theoryEuclidean algorithmgreatest common divisorcombinatorics unsolvedcombinatorics