Browse · MathNet
PrintSecond Round
Netherlands number theory
Problem
Given a positive integer , we denote by (‘n factorial’) the number we get if we multiply all integers from to . For example: .
a. Determine all integers with for which is a perfect square. Also, prove that you have found all solutions .
b. Prove that no positive integer exists such that is a perfect square.
a. Determine all integers with for which is a perfect square. Also, prove that you have found all solutions .
b. Prove that no positive integer exists such that is a perfect square.
Solution
a. We observe that , and therefore that . That product is a perfect square if and only if is a perfect square, since is a perfect square. For this is the case for (perfect squares minus one that are below ).
b. We rewrite the product as follows: Since and are both perfect squares, the above product is a perfect square if and only if is a perfect square. However, cannot be a perfect square. Indeed, suppose that were a perfect square. Since we would have , so . This is impossible because , which is not equal to .
b. We rewrite the product as follows: Since and are both perfect squares, the above product is a perfect square if and only if is a perfect square. However, cannot be a perfect square. Indeed, suppose that were a perfect square. Since we would have , so . This is impossible because , which is not equal to .
Final answer
a) n equals 3, 8, 15, 24, 35, 48, 63, 80, 99. b) No such positive integer exists.
Techniques
Factorization techniquesIntegersTechniques: modulo, size analysis, order analysis, inequalities