The author’s Elementary Fermat argument This was published on line in Blogs (1) and (2) in 2020 after being turned down by the Mathematical Gazette on the grounds that although the referees could not find a mistake, <<there must be a mistake in it somewhere>>! What does this brazenly presumptive dismissal say? It says that there is a professional animus against any attempt to rediscover Fermat’s lost elementary proof. This has become, in effect, a taboo: one which is perpetuating obfuscation over enlightenment, and ensuring that nothing will ever be done to resolve the situation. It is dooming the elementary subject to a deep subliminal sense of inadequacy, because Pierre de Fermat, a capable mathematician, probably had something essentially similar (i.e. a really elementary) proof in his hands more than 350 years ago! It is a scandal of the first order that capable higher mathematicians have left this situation unresolved for all this time. They should have appointed a task force in the 17th century with the distinct instruction to <<put-in whatever effort is necessary to rediscover the missing proof>>.
A number of friends and acquaintances (accomplished higher mathematicians) have taken a quick look at my 2020 argument, but they have made it clear that they are determined at all costs to “find” instant, trivial, imagined “objections”. This has then provided them with a flimsy excuse which —they have supposed— justifies them in abandoning the enquiry.
In response, the 24th blog on mathsforrenewingreason.com shows plainly how the proof applies for fifth powers (x5 + y5 = z5), in the major case when the inner tray Tab of (a+b)5 is not divisible by 5. After dividing the inner tray by 5 one could get a remainder of 4,3,2,1 or 0: so this condition covers 4/5ths of the possibilities. So the form of proof offered by the earlier posts covers 80% of the cases when p=5. For larger prime numbers the valid percentage gets larger and larger: for example, when p= 113 the probability that Tab is not divisible by 113 is 99.115%. We know that most of the infinite set of prime numbers are larger than the greatest known prime which is currently 282589933 -1, a number pm, with nearly 25 million digits. So the inner tray Tab is equally likely not to be divisible by pm in 282589933 – 2 of the cases, an unbelievably overwhelming majority. Now an infinite host of prime numbers are larger than pm, (compared with a finite number less) so the norm is that an unbelievably vast majority of residues are > 0 and the proven case covers 99.9999…and so on… % of the possibilities, the ‘and so on’ here signalling about 25 million decimal 9s.
When p = 5 the majority case argument is much easier to follow than that of the original 2020 generalised proof. It can also easily be seen to generalise to whatever value we substitute for 5. It will, no doubt, finally become recognised, but don’t hold your breath, because confidence in maths at all levels is currently at an all-time low.
The ‘Glitch’ mentioned in Blog 25
In the previous Blog (25) a “glitch” was reported in the original 2020 minor argument. However closer inspection shows that it was only the relatively slight matter that Y and L were mistreated as natural numbers. Proposition (37) was that when p =- 7
(Y+N1ABZ)7/7L7 – b4 should have the factor A. …………………………..(1) (This builds-in the requirement that a cascade of merging terms can occur.)
We can find out whether the requirement (1) is met by substituting A=0 in (1).
When A=0 this becomes Y7/7L7 – (B4)7 …………………………………………(2)
But when A= 0, L and Y become specific numbers which are denoted L and Y;
they are not, however, necessarily natural numbers or even rational numbers.
We look at the specifics here: [76 = 117649.]
When A=0, Tab = b4. And v = 117649V7 = Tab, so V = (b4/117649)1/7.
Now Y = Tab/7V, or b4/ b4/7/713/7 or b24/7/713/7 .
L = Tab/49V2 . or b4/49(b4/117649)2/7 or b20/7/72/7 .
So (2) becomes (b24/713)/(b20/7) – b4, or b4/712 – b4 which is clearly not zero.
It follows that the condition (1) is not met and that this is a contradiction, because the expression for v is composed entirely of terms with the factor A apart from b4 at the far end of Tab.
Substituting any other prime number for ‘7’ in this reasoning obviously generalises the argument to all possible cases except p=2 and powers of 2.
What is absolutely clear is that v-b4 has the factor A and that putting A=0 will turn it into zero. But if we build into v the precondition that the cascade of merging can occur, it no longer equals zero. This shows quite emphatically that the pre-condition can’t be met.
This establishes the minor case of the Fermat Result when p=7. It is easier to follow in this specific case rather than the general case. p=7 is the simplest minor case, because when p=5, the minor case does not arise.
Both the major and minor cases have now been established when p= 5 and p = 7 respectively, but of course this is just a clear sign that the form of reasoning in the general case is valid. It should be a moment for much rejoicing, because a dark cloud which has hung over elementary mathematics since the early 17th century, has, at last, been resolved. However morale in both elementary and higher maths is currently at an all-time low, and it is anyone’s guess how long it will take for this relief to be widely felt.
CHRISTOPHER ORMELL 1st July 2022