Maths Olympiad Prep

Library / /309 of 462

, 2014

Number theory Difficulty 6.2 National Olympiad Prove it Ireland

Each of the four positive integers N,N+1,N+2,N+3N, N+1, N+2, N+3 has exactly six positive divisors. There are exactly 20 different positive integers which are exact divisors of at least one of the integers. One of these is 27. Find all possible values of NN.

(Both 1 and mm are counted as divisors of the integer mm.)

Solution

Each of the four integers has 1 as a divisor. Moreover, 2 is a common divisor of either NN and N+2N+2 or N+1N+1 and N+3N+3. Hence, these four integers can have at most 6×431=206 \times 4 - 3 - 1 = 20 different divisors altogether. Because there are exactly 20 different positive divisors, only one of the four integers can be divisible by 3, that is either N+1N+1 or N+2N+2 is divisible by 3.

As 27 is a divisor of one of the integers, and the integer has exactly six divisors, that number must be 35=2433^5 = 243. This can be seen, for example, by recognising that an integer p1a1pnanp_1^{a_1} \cdots p_n^{a_n}, with primes p1<<pnp_1 < \cdots < p_n and ai1a_i \ge 1, has exactly (a1+1)(an+1)(a_1+1) \cdots (a_n+1) different positive divisors.

Hence N+1=243N+1 = 243 or N+2=243N+2 = 243. Because 2432=241243-2 = 241 is a prime number (having only two positive divisors), we can only have N=242N = 242.

It is easily checked that the four numbers 242=2112242 = 2 \cdot 11^2, 243=35243 = 3^5, 244=2261244 = 2^2 \cdot 61 and 245=572245 = 5 \cdot 7^2 have exactly 20 divisors, namely 1, 2, 3, 4, 5, 7, 9, 11, 22, 27, 35, 49, 61, 81, 121, 122, 242, 243, 244 and 245.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.