3
Problems(2)
Classical number theory
Source: III Caucasus Mathematical Olympiad
3/17/2018
Suppose that are positive integers such that divides , and divides . Prove that divides .
number theory
very nice combinatorics with NT
Source: III Caucasus Mathematical Olympiad
3/17/2018
For positive integers a matching (i.e. dividing them into pairs) is called {\it non-square} if the product of two numbers in each pair is not a perfect square. Prove that if there is a non-square matching, then there are at least non-square matchings.
(By denote the product .)
combinatoricsnumber theory