Without evaluation of it, prove that the number
N = 27,195^8  10,887^8 + 10,152^8 is divisible by
26,460.
Note: the original problem mistakenly listed the last number as 26,640. This has been corrected
(In reply to
re(4): Remove Problem by pcbouhid)
Taking the 2nd, 4th and 8th powers, mod the divisibility base, of each number separately, and adding and subtracting as was done here in fact does not evaluate the number N. The highest number used in the calculation was 557,715,456, which was 23,616^2, before reduction mod 26,640. Nowhere was the value of N (299081650248424125032066397497936160 per Jer's post) computed in that solution.

Posted by Charlie
on 20050527 15:20:26 