Further to a chat we had at coffee today about nutters who think they are the next Einstein I thought that I'd just post up an email I recieved a few months ago:
"The Fermat Little Theorem, with extended hint",
a proof by Brian S. McMillan.
Good old Brian S. McMillan is either so far ahead of the curve that I just can't grasp what he's doing here, or he's so far behind it that he fell off the back of the short bus.
The best thing part of the email, however, was a link to his homepage: http://www.godkings.com. Note that those things that look like email addresses at the left of the page are actually links to deeper levels of his site.
"The Fermat Little Theorem, with extended hint",
a proof by Brian S. McMillan.
IF: (2^(P-1)-1)/P = Integer, Fermat c 1650
WHERE: P = Prime or Pseudo-Prime
AND: (2^(P-1)-1)/P = N (PN±2) McMillan c2003
THEN: (2^((P-1)/2) ±1)/P = N Integer
The last two equations above completes the
proof. However, since an algebraic proof in
its most simple terms, has never been
provided, since Fermat was in the habit of
not providing any, saying he would except-for
fear of it being to long. And, since the
proof that I have discovered is so brief, and
in its simplest terms, it is highly unlikely
that Fermat ever had one!
These equations provide proof for the Twin-
Primes Conjecture and a host of other related
conjectures, including the Fermat Conjecture
above; It can now be called a theorem!
Good old Brian S. McMillan is either so far ahead of the curve that I just can't grasp what he's doing here, or he's so far behind it that he fell off the back of the short bus.
The best thing part of the email, however, was a link to his homepage: http://www.godkings.com. Note that those things that look like email addresses at the left of the page are actually links to deeper levels of his site.
