MathLabs

Problem 4

A proper divisor of a positive integer NN is a positive divisor of NN other than NN itself. The infinite sequence a1,a2,…a_1,a_2,\ldots consists of positive integers, each of which has at least three proper divisors. For each n≥1n\ge1, the integer an+1a_{n+1} is the sum of the three largest proper divisors of ana_n. Determine all possible values of a1a_1.
Step 4 of 8: Necessity: every term must also be a multiple of 3
3∤x, 2∣x ⟹ σ(x)<x and 3∤σ(x)3\nmid x,\ 2\mid x\ \Longrightarrow\ \sigma(x)<x\ \text{and}\ 3\nmid\sigma(x)
Detailed analysis

Suppose xx is even but 3∤x3\nmid x. The two smallest divisors exceeding 11 are 22 and either 44 or a prime p≥5p\ge5, and a short case check on the third-smallest divisor shows σ(x)≡0(mod3)\sigma(x)\equiv0\pmod3 never occurs while 3∤x3\nmid x; combined with the size bound σ(x)≤(12+14+15)x<x\sigma(x)\le\bigl(\tfrac12+\tfrac14+\tfrac15\bigr)x<x, if some aia_i were even but not a multiple of 33, the sequence would again decrease strictly forever, which is impossible. Hence every aia_i is divisible by both 22 and 33, i.e. by 66.