Problem

Source: 2020 Israel National Olympiad P6

Tags: combinatorics, national olympiad



On a circle the numbers from 1 to 6 are written in order, as depicted in the picture. In each move, Lior picks a number $a$ on the circle whose neighbors are $b$ and $c$ and replaces it by the number $\frac{bc}{a}$. Can Lior reach a state in which the product of the numbers on the circle is greater than $10^{100}$ in a) at most 100 moves b) at most 110 moves


Attachments: