We consider positive integers n having at least six positive divisors. Let the positive divisors of n be arranged in a sequence (di)1≤i≤k with 1=d1<d2<⋯<dk=n(k≥6).Find all positive integers n such that n=d25+d26.
Problem
Source: Czech-Polish-Slovak Match 2019 P2
Tags: number theory
XbenX
15.07.2019 21:10
The only solution is n=500.
Claim: n is even.
Proof: Assume that n is odd, then all of its divisors are odd and d25+d26 is even, wich is not true. ◼
Claim: d5 and d6 have the same prime divisors and both of them have less than 2 prime divisors.
Proof: Note that n=d5dk−4=d6dk−5 and n=d5dk−4=d25+d26⟺dk−4−d5=d26d5 wich shows that prime divisors of d5 also divide d6 and in the same way we show that prime divisors of d6 divide d5.
If they have more than 3 prime divisors then let p1,p2,p3 be the least prime divisors of n then n is also divisible by 1,p1,p2,p3,p1p2,p1p3,p2p3 are less than d5,d6 wich is not true. ◼
Claim: d5 and d6 are even.
Proof: If not, then p,q>2 are divisors of d5,d6 then 1,2,p,q,2p,2q are divisors of n less than d5,d6 wich is not true. ◼
Therefore n is divisible by 4 and now we have three cases:
If first divisors of n are 1,2,3,4,6,12, then n=122+62 implies 5∣n wich is not true.
If first divisors of n are 1,2,4,p,2p,4p then n=4p2+16p2=20p2 wich implies that p=5 and gives n=2253=500 a solution.
If first 6 divisors of n are 1,2,22,…25 then n=28⋅5 wich is not a solution.