Maths Olympiad Prep

Track / Stage 4 / 30 of 340 #770 of 2444

Problem 770

AMC 12 late, AIME early
Number theory Difficulty 4.1 Prove it CEMC Hypatia · Canada · 2012

The positive divisors of 21 are 1, 3, 7 and 21. Let S(n)S(n) be the sum of the positive divisors of the positive integer nn. For example, S(21)=1+3+7+21=32S(21)=1+3+7+21=32.

If pp is an odd prime integer, find the value of pp such that S(2p2)=2613S(2p^2)=2613.
The consecutive integers 1414 and 1515 have the property that S(14)=S(15)S(14)=S(15). Determine all pairs of consecutive integers mm and nn such that m=2pm=2p and n=9qn=9q for prime integers p,q>3p,q>3, and S(m)=S(n)S(m)=S(n).
Determine the number of pairs of distinct prime integers pp and qq, each less than 30, with the property that S(p3q)S(p^3 q) is not divisible by 24.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

Since pp is an odd prime integer, then p>2p>2.

Since the only prime divisors of 2p22p^2 are 2 and pp, then the positive divisors of 2p22p^2 are 1,2,p,2p,p21,2,p,2p,p^2, and 2p22p^2.

So then, S(2p2)=1+2+p+2p+p2+2p2=3p2+3p+3S(2p^2)=1+2+p+2p+p^2+2p^2=3p^2+3p+3.

Since S(2p2)=2613S(2p^2)=2613, then 3p2+3p+3=26133p^2+3p+3=2613 or 3p2+3p2610=03p^2+3p-2610=0 or p2+p870=0p^2+p-870=0.

Factoring, (p+30)(p29)=0(p+30)(p-29)=0, and so p=29p=29 (p30p\neq -30 since pp is an odd prime).
Suppose m=2pm=2p and n=9qn=9q for some prime numbers p,q>3p,q>3.

The positive divisors of 2p2p, thus mm, are 1,2,p1,2,p, and 2p2p (since p>3p>3).

Therefore, S(m)=1+2+p+2p=3p+3S(m)=1+2+p+2p=3p+3.

The positive divisors of 9q9q, thus nn, are 1,3,q,3q,91,3,q,3q,9, and 9q9q (since q>3q>3).

Therefore, S(n)=1+3+9+q+3q+9q=13q+13S(n)=1+3+9+q+3q+9q=13q+13.

Since S(m)=S(n)S(m)=S(n), then 3p+3=13q+133p+3=13q+13 or 3p13q=103p-13q=10.

Also, mm and nn are consecutive integers and so either mn=1m-n=1 or nm=1n-m=1.

If mn=1m-n=1, then 2p9q=12p-9q=1.

We solve the following system of two equations and two unknowns. 2p9q=13p13q=10\begin{align*} 2p-9q & = 1 \tag{1}\\ 3p-13q & = 10 \tag{2} \end{align*} Multiplying equation (1) by 3 and equation (2) by 2 we get, 6p27q=36p26q=20\begin{align*} 6p-27q& = 3 \tag{3}\\ 6p-26q & = 20 \tag{4}\end{align*} Subtracting equation (3)(3) from equation (4)(4), we get q=17q=17.

Substituting q=17q=17 into equation (1)(1), 2p9(17)=12p-9(17)=1 or 2p=1542p=154, and so p=77p=77.

However, pp must be a prime and thus p77p\neq 77.

There is no solution when mn=1m-n=1.

If nm=1n-m=1, then 9q2p=19q-2p=1.

We solve the following system of two equations and two unknowns. 9q2p=13p13q=10\begin{align*} 9q-2p & = 1 \tag{5}\\ 3p-13q & = 10 \tag{6} \end{align*} Multiplying equation (5)(5) by 3 and equation (6)(6) by 2 we get, 27q6p=36p26q=20\begin{align*} 27q-6p & = 3 \tag{7} \\ 6p-26q & = 20 \tag{8}\end{align*} Adding equation (7)(7) and equation (8)(8), we get q=23q=23.

Substituting q=23q=23 into equation (6)(6), 3p13(23)=103p-13(23)=10 or 3p=3093p=309, and so p=103p=103.

Since q=23q=23 and p=103p=103 are prime integers greater than 3, then m=2(103)=206m=2(103)=206 and n=9(23)=207n=9(23)=207 are the only pair of consecutive integers satisfying the given properties.
Since the only prime divisors of p3qp^3q are pp and qq, then the positive divisors of p3qp^3q, are 1,p,q,pq,p2,p2q,p31,p,q, pq, p^2, p^2q, p^3, and p3qp^3q (since pp and qq are distinct primes).

Therefore, S(p3q)=p3q+p3+p2q+p2+pq+p+q+1S(p^3q)=p^3q+p^3+p^2q+p^2+pq+p+q+1.

Simplifying,

S(p3q)=p3q+p3+p2q+p2+pq+p+q+1=(p3q+p2q+pq+q)+(p3+p2+p+1)=q(p3+p2+p+1)+(p3+p2+p+1)=(q+1)(p3+p2+p+1)=(q+1)(p2(p+1)+(p+1))=(q+1)(p+1)(p2+1)\begin{aligned} S(p^3q)&=p^3q+p^3+p^2q+p^2+pq+p+q+1\\ &=(p^3q+p^2q+pq+q)+(p^3+p^2+p+1)\\&=q(p^3+p^2+p+1)+(p^3+p^2+p+1)\\& =(q+1)(p^3+p^2+p+1)\\ &=(q+1)(p^2(p+1)+(p+1))\\ &=(q+1)(p+1)(p^2+1) \end{aligned}

We are to determine the number of pairs of distinct primes pp and qq, each less than 30, such that (q+1)(p+1)(p2+1)(q+1)(p+1)(p^2+1) is not divisible by 24.

There are 10 primes less than 30. These are 2,3,5,7,11,13,17,19,232,3,5,7,11,13,17,19,23 and 2929.

Therefore, the total number of possible pairs (p,q)(p,q), where pqp\neq q, is 10×9=9010\times 9 = 90.

We will count the number of pairs (p,q)(p,q) for which (q+1)(p+1)(p2+1)(q+1)(p+1)(p^2+1) is divisible by 24 and then subtract this total from 90.

If pp or qq equals 23, then 24 divides (q+1)(p+1)(p2+1)(q+1)(p+1)(p^2+1).

There are 9 ordered pairs of the form (23,q)(23,q) and 9 of the form (p,23)(p,23).

Thus, we count 18 pairs and since we have exhausted all possibilities using 23, we remove it from our list of 10 primes above.

Since 24=23×324=2^3\times 3, we can determine values of qq for a given value of pp by recognizing that each of these prime factors (three 2s and one 3) must occur in the prime factorization of (q+1)(p+1)(p2+1)(q+1)(p+1)(p^2+1).

For example if p=2p=2, then (q+1)(p+1)(p2+1)=(q+1)(3)(5)(q+1)(p+1)(p^2+1)=(q+1)(3)(5).

Therefore, for (q+1)(p+1)(p2+1)(q+1)(p+1)(p^2+1) to be a multiple of 24, q+1q+1 must be a multiple of 8 (since we are missing 232^3).

Thus when p=2p=2, the only possible value of qq is 7 (we get this by trying the other 8 values in the list of primes).

We organize all possibilities for pp (and the resulting values of qq) in the table below.

pp
(p+1)(p2+1)(p+1)(p^2+1)
q+1q+1 must be a multiple of
qq (distinct from pp)
Number of ordered pairs

2
(3)(5)(3)(5)
23=82^3=8
q=7q=7
1

3
(4)(10)=23×5(4)(10)=2^3\times5
3
q=2,5,11,17,29q=2,5,11,17,29
5

5
(6)(26)=22×3×13(6)(26)=2^2\times3\times13
2
q=3,7,11,13,17,19,29q=3,7,11,13,17,19,29
7

7
(8)(50)=23×50(8)(50)=2^3\times50
3
q=2,5,11,17,29q=2,5,11,17,29
5

11
(12)(122)=23×3×61(12)(122)=2^3\times3\times61
any qq will work
q=2,3,5,7,13,17,19,29q=2,3,5,7,13,17,19,29
8

13
(14)(170)=22×595(14)(170)=2^2\times595
2×3=62\times3=6
q=5,11,17,29q=5,11,17,29
4

17
(18)(290)=22×3×435(18)(290)=2^2\times3\times435
2
q=3,5,7,11,13,19,29q=3,5,7,11,13,19,29
7

19
(20)(362)=23×905(20)(362)=2^3\times905
3
q=2,5,11,17,29q=2,5,11,17,29
5

29
(30)(842)=22×3×2105(30)(842)=2^2\times3\times2105
2
q=3,5,7,11,13,17,19q=3,5,7,11,13,17,19
7

The total number of pairs (p,q)(p,q) for which 24 divides S(p3q)S(p^3q) is 18+1+5+7+5+8+4+7+5+7=67.18+1+5+7+5+8+4+7+5+7=67. Thus, the total number of pairs of distinct prime integers pp and qq, each less than 30, such that S(p3q)S(p^3q) is not divisible by 24, is 9067=2390-67=23.

Source: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.