board with lowest poaitive fractions
Source: Nigerian Mathematics olympiad round 2 2021 problem 3
February 15, 2021
combinatoricsnumber theory
Problem Statement
On a certain board, fractions are always written in their lowest form. Pionaj starts with 2 random positive fractions. After every minute,he replaces one of the previous 2 fractions (at random) with a new fraction that is equal to the sum of their numerators divided by the sum of their denominators. Given that he continues this indefinitely, show that eventually all the resulting fractions would be in their lowest forms even before writing them on the board(recall that he has to reduce each fration to their lowest form beore writing it on the board for the next operation). (for example starting with and he may replace it with