From
A Squared Divisor we know for all natural numbers n>=2 that n^(n-1)-1 is divisible by (n-1)^2.
Prove that n=2 and n=3 are the only natural numbers such that n^(n-1)-1 is divisible by (n-1)^3.
Method: Solve a easier expression, then relate it to the required one.
Start with (2(n^(n-1)+(n-1)^3-(n-1)^2-1))/(n-1)^3
For n>3,
2(n^(n-1)) = 2, mod(n-1)
2(n-1)^3 = 0, mod(n-1)
2(n-1)^2 = 0, mod(n-1)
2(-1) =-2, mod(n-1)
so the whole expression is worth 0, mod (n-1), and always an integer.
But (2(n^(n-1)+(n-1)^3-(n-1)^2-1))/(n-1)^3 = 2((n^(n-1)-1)/(n-1)^3+(n-2)/(n-1))
To approach the required expression, first divide by 2, leaving a number, (n^(n-1)-1)/(n-1)^3, plus a fraction,(n-2)/(n-1), less than 1. Even assuming that the expression remained an integer after the division by 2, once we deduct that fraction, the number, which is the required expression, is an integer diminished by 1/(n-1) and thus can never result in an integer division.
Edited on March 27, 2025, 3:54 am
|
Posted by broll
on 2025-03-27 03:39:34 |