Go Back > Extra Stuff > Blogorrhea > LaurV

Thread Tools
Old 2019-05-14, 14:01   #12
Dr Sardonicus
Dr Sardonicus's Avatar
Feb 2017

23×3×5×29 Posts

Originally Posted by CRGreathouse View Post
LaurV wants us to figure out what he means by "computational proofs" and exclude those; apparently this result is considered such.
Kummer showed that FLT was true for "regular" primes p. Regularity can be established computationally. There is also a computational method of proving FLT for a given irregular prime p related to the Kummer-Vandiver conjecture. It is described (briefly) just before the Acknowledgements in the paper here. (I know, this is a post-FLT proof paper, but had the merit of being easily available. It basically extends the computations of the previously-referenced paper.)
Historically, this test was devised by Vandiver, building on Kummer’s results on cyclotomic fields, in connection with Fermat’s last theorem: Vandiver proved that Fermat’s last theorem is true for p if there is a prime q less than p2 − p such that the above criterion is true for all irregular pairs (p, t) for the given prime p.
Dr Sardonicus is offline   Reply With Quote
Old 2019-05-15, 04:01   #13
Romulan Interpreter
LaurV's Avatar
Jun 2011

2×3×31×47 Posts

Originally Posted by lukerichards View Post
English pedantic correction: Sir Andrew.
Thanks. (I didn't know! )

Originally Posted by Dr Sardonicus View Post
Kummer showed that FLT was true for "regular" primes p. Regularity can be established computationally.
We are clear up to here. Not only, but also for irregular pairs, which is a much MUCH stronger condition. But after that, you lost me. I think I have to put my nose into those papers...

Last fiddled with by LaurV on 2019-05-15 at 04:01
LaurV is offline   Reply With Quote

Thread Tools

All times are UTC. The time now is 20:31.

Sun Sep 27 20:31:25 UTC 2020 up 17 days, 17:42, 0 users, load averages: 1.20, 1.64, 1.66

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.