Determine all integers n⩾1 for which there exists a pair of positive integers (a,b) such that no cube of a prime divides a2+b+3 and a2+b+3ab+3b+8=n
A number or a short expression. Spacing and $ signs are ignored.
Solution
As b≡−a2−3(moda2+b+3), the numerator of the given fraction satisfies ab+3b+8≡a(−a2−3)+3(−a2−3)+8≡−(a+1)3(moda2+b+3) As a2+b+3 is not divisible by p3 for any prime p, if a2+b+3 divides (a+1)3 then it does also divide (a+1)2. Since 0<(a+1)2<2(a2+b+3) we conclude (a+1)2=a2+b+3. This yields b=2(a−1) and n=2. The choice (a,b)=(2,2) with a2+b+3=9 shows that n=2 indeed is a solution.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.