In the beginning, the numbers $1, 2, 3, ..., 57$ were written on the board. In each process, the numbers a and b are selected and deleted from the board so that the number $a$ divides the number $b$ completely. The number $\frac{b}{a}$ is written instead of the deleted numbers (For example, in the first operation, the numbers $a = 3$ and $b = 9$ can be deleted and the number $\frac{9}{3} = 3$ can be written on the board again). At least how many numbers can be left on the board after a few actions?
It is clear that the remaining numbers are primes $29,31,37,41,43,47,53$. In each of my attempts, I find $2$ different numbers in addition to these prime. But I am waiting for your answers to see more different points of view.
(Fill in the gaps as needed. If you're stuck, show your work and explain what you've tried.)
Hint: Consider the prime factorization of $ 57! $.
Focus on those whose power is odd.
As you've realized, the primes $> 28$ must always occur. These have power of 1 in the prime factorization.
Claim: The product of the numbers that are left can be written in the form $ \frac{ \prod_{a \in A } a } { \prod_{b \not \in A } b } $, where $ A \subset [57]$.
Claim: If $p ^k \mid \mid 57$ and $k$ is odd, then we're always left with a term that is a multiple of $p$.
Corollary: The product of the numbers at the end is
Corollary: We must have at least $X$ numbers left behind. Recall that each of these numbers is less than 57.
Corollary: The minimum left behind is $X$, and we need to find a contraction that yields $X$.
(Disclaimer: I've not done this yet.)