Browse · MathNet
PrintEstonian Mathematical Olympiad
Estonia number theory
Problem
Find all triples of positive integers, such that
Solution
Solution 1: If , then , so . Two distinct factorials differ by a factor of at least 2, so would yield , contradiction. Analogously would yield , contradiction. Therefore the only option is . Then the given equation simplifies to . Here and the product of must be 3. This can only happen when , giving the solution . If , then , so . Analogously to the previous case we get . Then the given equation simplifies to or . Analogously to the previous case, this is only possible when , giving the solution .
Solution 2: Notice that and , because if either or , then where dividing by gives , from which , contradiction.
If , then like in Solution 1, we only get the solution . If , then like in Solution 1, we only get the solution . * If and , then where dividing by gives . This leaves only the option , which is impossible by the assumptions and .
Solution 3: We divide the sides by the smallest factorial present in the equation. This leaves an equation , where are positive integers, of which at least one is equal to 1. If , then , giving no solutions. If , then , also giving no solutions. If and , then and , meaning that both and are divisible by . Then 3 is also divisible by , which gives . Then , or else the right hand side of the equation is divisible by 4, whereas the left hand side isn't. Then also . If and , then and , meaning that both and are divisible by . Then 4 is also divisible by , which gives or . If , then , or else the right hand side of the equation is divisible by 3, whereas the left hand side isn't. Then also . But if , then the left hand side is never divisible by 5, so there are no solutions. Thus the only suitable triples are and .
Solution 2: Notice that and , because if either or , then where dividing by gives , from which , contradiction.
If , then like in Solution 1, we only get the solution . If , then like in Solution 1, we only get the solution . * If and , then where dividing by gives . This leaves only the option , which is impossible by the assumptions and .
Solution 3: We divide the sides by the smallest factorial present in the equation. This leaves an equation , where are positive integers, of which at least one is equal to 1. If , then , giving no solutions. If , then , also giving no solutions. If and , then and , meaning that both and are divisible by . Then 3 is also divisible by , which gives . Then , or else the right hand side of the equation is divisible by 4, whereas the left hand side isn't. Then also . If and , then and , meaning that both and are divisible by . Then 4 is also divisible by , which gives or . If , then , or else the right hand side of the equation is divisible by 3, whereas the left hand side isn't. Then also . But if , then the left hand side is never divisible by 5, so there are no solutions. Thus the only suitable triples are and .
Final answer
(2, 1, 2) and (2, 3, 3)
Techniques
Techniques: modulo, size analysis, order analysis, inequalitiesFactorization techniques