2019 AIME I Problem 9

Below is the professionally curated solution for Problem 9 of the 2019 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2019 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:factor countingperfect squarecasework

Difficulty rating: 2740

9.

Let τ(n)\tau(n) denote the number of positive integer divisors of n.n. Find the sum of the six least positive integers nn that are solutions to τ(n)+τ(n+1)=7.\tau(n) + \tau(n + 1) = 7.

Solution:

Since 7=2+5=3+4,7 = 2 + 5 = 3 + 4, one of τ(n),τ(n+1)\tau(n), \tau(n+1) equals 33 or 5,5, and τ=3\tau = 3 means a prime square p2p^2 while τ=5\tau = 5 means a prime fourth power p4.p^4. So one of n,n+1n, n+1 lies in {4,9,25,49,121,169,289,361,}{16,81,625,},\{4, 9, 25, 49, 121, 169, 289, 361, \ldots\} \cup \{16, 81, 625, \ldots\}, and its neighbor must have τ=4\tau = 4 (for a square) or be prime (for a fourth power).

Checking neighbors in increasing order: n=8n = 8 works (τ(8)=4,(\tau(8) = 4, τ(9)=3);\tau(9) = 3); n=9n = 9 works (τ(10)=4);(\tau(10) = 4); n=16n = 16 works (τ(16)=5,(\tau(16) = 5, 1717 prime);); n=25n = 25 works (τ(26)=4).(\tau(26) = 4). Then 49,81,169,49, 81, 169, and 289289 all fail: τ(48)=10,\tau(48) = 10, τ(50)=6,\tau(50) = 6, τ(80)=10,\tau(80) = 10, 8282 is not prime, τ(168)=16,\tau(168) = 16, τ(170)=8,\tau(170) = 8, τ(288)=18,\tau(288) = 18, τ(290)=8.\tau(290) = 8. Next, n=121n = 121 works (τ(122)=4)(\tau(122) = 4) and n=361n = 361 works (τ(362)=4).(\tau(362) = 4).

The six least solutions are 8,9,16,25,121,361,8, 9, 16, 25, 121, 361, with sum 540.540.

← Problem 8Full ExamProblem 10

Problem 9 in Other Years