Browse · MathNet
Print74th NMO Selection Tests for JBMO
Romania number theory
Problem
The integers from to are written in a table, such that for any , the product of the numbers in the -th row equals the product of the numbers in the -th row.
a) Prove that there exists a row such that the sum of the numbers written on it is a prime number.
a) Prove that there exists a row such that the sum of the numbers written on it is a prime number.
Solution
a) Let be the products of the elements of the rows . We have , and , so , (1).
Note that . From (1) we infer that the primes which have odd exponents in the prime factorization of must appear in the prime factorization of one of the numbers situated on the -th row, thus . The product of any two of the primes and exceeds , therefore each of these primes divides exactly one of the numbers situated on the -th row.
The number is a perfect square, hence if , we have that , thus one of the numbers written in the cells of the table will be at least equal to , false.
Therefore, the -th row contains the numbers , whose sum is the prime .
Note that . From (1) we infer that the primes which have odd exponents in the prime factorization of must appear in the prime factorization of one of the numbers situated on the -th row, thus . The product of any two of the primes and exceeds , therefore each of these primes divides exactly one of the numbers situated on the -th row.
The number is a perfect square, hence if , we have that , thus one of the numbers written in the cells of the table will be at least equal to , false.
Therefore, the -th row contains the numbers , whose sum is the prime .
Techniques
Prime numbersFactorization techniques