MathDB
Finances

Source: Russian TST 2020, Day 6 P1

March 21, 2023
combinatoricsnumber theory

Problem Statement

There are coins worth 1,2,,b1, 2, \ldots , b rubles, blue bills with worth aa{} rubles and red bills worth a+ba + b rubles. Ilya wants to exchange a certain amount into coins and blue bills, and use no more than a1a-1 coins. Pasha wants to exchange the same amount in coins and red bills, but use no more than aa{} coins. Prove that they have equally many ways of doing so.