- #71
- 2,009
- 985
That is the easy method to show it.mfb said:3987 and 4365 are divisible by 3, therefore their 12th powers are divisible by 3, same for the sum. 4472 is not divisible by 3, and taking the 12th power doesn't change that.
That is the easy method to show it.mfb said:3987 and 4365 are divisible by 3, therefore their 12th powers are divisible by 3, same for the sum. 4472 is not divisible by 3, and taking the 12th power doesn't change that.
A check on simply the last digit does not rule out the possibility that the equality could hold. Before Fermat's last theorem was proven by Andrew Wiles, had someone come up with something like this that worked, it would have been one of the better numerical finds of the century. As I recall, as early as 1970, Fermat's theorem had already been established for exponents ## n ## up to 169, so it would have been some very large numbers that would have been necessary to make such a sum.scottdave said:That is the easy method to show it.
Not the last digit. Sum the digits to see if a multiple of 3.Charles Link said:A check on simply the last digit does not rule out the possibility that the equality could hold. Before Fermat's last theorem was proven by Andrew Wiles, had someone come up with something like this that worked, it would have been one of the better numerical finds of the century. As I recall, as early as 1970, Fermat's theorem had already been established for exponents ## n ## up to 169, so it would have been some very large numbers that would have been necessary to make such a sum.
Yes, @scottdave , @mfb 's method is clever.scottdave said:Not the last digit. Sum the digits to see if a multiple of 3.
I think this is the only one so far which fulfills the propositions.stoomart said:##\overbrace{\smile}^{\theta\theta}##
"Unsolved" is debatable. O.k. apparently nobody can really follow the suggested proof, but does this count for "unsolved"?Demystifier said:If the above is not counted as an actual equation, then I would mention one of the most difficult unsolved problems in number theory:
##a+b=c##
I didn't know that there is a suggested proof. Reference?fresh_42 said:"Unsolved" is debatable. O.k. apparently nobody can really follow the suggested proof, but does this count for "unsolved"?
I see a nest of golden ratios in there, (√5 ± 1 ) / 2.Ssnow said:a beautiful combination of 1,2,3,4,5,6 and other ...