Discussion:
Fermat's (updated approaches, 3 total, plus a little more)
(too old to reply)
Simon Roberts
2018-02-11 21:32:15 UTC

https://www.dropbox.com/sh/602u4zmdr1b4goz/AACKp6RaA3KD7H6i4Ci15QxPa?dl=0

The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"

2 more similar versions (59 and Aug. 23 2016) but much different than the most recent(Y.55.1).

Gosh, if these are sound but rough, I must piss a few people off.

Anyway, the oldest version from August 23 or 24 2016 (i can hardly believe the date (year) is correct). I feel as if I've been through alot (so to speak) please pardon me for this. The approach within 59 may be (might be) generalized to different Diophantine equations but a certain similar class of equations. Although I am not sure of the proof (it at least needs to be edited) therefore not certain of the possible or potential generalization(s).

I still like (not necessarily proud. it was found as they say) so called theorem 1.1 which is (that is?) a semi-inductive prove of the properties (of say) (a^p -b^p) / (a -b) where p doesn't divide (a-b) and a and b are coprime. The theorem (if novel; i forgot it may have been done previously to this one) may imply a proof of the infinitude of primes as well. Found that, I believe, back in 2010 -2011. All ironed it out but not an exactly an easy read; it can be written better, I just can't right now. The latest version is ... X.35.depq5

The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"

Simon Roberts
***@gmail.com
affiliation : none.
Thanks and Thank You
Simon Roberts
2018-02-12 06:18:48 UTC
Post by Simon Roberts
https://www.dropbox.com/sh/602u4zmdr1b4goz/AACKp6RaA3KD7H6i4Ci15QxPa?dl=0
The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"
2 more similar versions (59 and Aug. 23 2016) but much different than the most recent(Y.55.1).
Gosh, if these are sound but rough, I must piss a few people off.
Anyway, the oldest version from August 23 or 24 2016 (i can hardly believe the date (year) is correct). I feel as if I've been through alot (so to speak) please pardon me for this. The approach within 59 may be (might be) generalized to different Diophantine equations but a certain similar class of equations. Although I am not sure of the proof (it at least needs to be edited) therefore not certain of the possible or potential generalization(s).
I still like (not necessarily proud. it was found as they say) so called theorem 1.1 which is (that is?) a semi-inductive prove of the properties (of say) (a^p -b^p) / (a -b) where p doesn't divide (a-b) and a and b are coprime. The theorem (if novel; i forgot it may have been done previously to this one) may imply a proof of the infinitude of primes as well. Found that, I believe, back in 2010 -2011. All ironed it out but not an exactly an easy read; it can be written better, I just can't right now. The latest version is ... X.35.depq5
The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"
Simon Roberts
affiliation : none.
Thanks and Thank You
Simon Roberts
2018-02-13 00:54:32 UTC
Post by Simon Roberts
https://www.dropbox.com/sh/602u4zmdr1b4goz/AACKp6RaA3KD7H6i4Ci15QxPa?dl=0
The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"
2 more similar versions (59 and Aug. 23 2016) but much different than the most recent(Y.55.1).
Gosh, if these are sound but rough, I must piss a few people off.
Anyway, the oldest version from August 23 or 24 2016 (i can hardly believe the date (year) is correct). I feel as if I've been through alot (so to speak) please pardon me for this. The approach within 59 may be (might be) generalized to different Diophantine equations but a certain similar class of equations. Although I am not sure of the proof (it at least needs to be edited) therefore not certain of the possible or potential generalization(s).
I still like (not necessarily proud. it was found as they say) so called theorem 1.1 which is (that is?) a semi-inductive prove of the properties (of say) (a^p -b^p) / (a -b) where p doesn't divide (a-b) and a and b are coprime. The theorem (if novel; i forgot it may have been done previously to this one) may imply a proof of the infinitude of primes as well. Found that, I believe, back in 2010 -2011. All ironed it out but not an exactly an easy read; it can be written better, I just can't right now. The latest version is ... X.35.depq5
The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"
Simon Roberts
affiliation : none.
Thanks and Thank You
version 59 (or 60) is incorrect, just plain wrong.
Simon Roberts
2018-02-13 01:32:16 UTC
Post by Simon Roberts
https://www.dropbox.com/sh/602u4zmdr1b4goz/AACKp6RaA3KD7H6i4Ci15QxPa?dl=0
The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"
2 more similar versions (59 and Aug. 23 2016) but much different than the most recent(Y.55.1).
Gosh, if these are sound but rough, I must piss a few people off.
Anyway, the oldest version from August 23 or 24 2016 (i can hardly believe the date (year) is correct). I feel as if I've been through alot (so to speak) please pardon me for this. The approach within 59 may be (might be) generalized to different Diophantine equations but a certain similar class of equations. Although I am not sure of the proof (it at least needs to be edited) therefore not certain of the possible or potential generalization(s).
I still like (not necessarily proud. it was found as they say) so called theorem 1.1 which is (that is?) a semi-inductive prove of the properties (of say) (a^p -b^p) / (a -b) where p doesn't divide (a-b) and a and b are coprime. The theorem (if novel; i forgot it may have been done previously to this one) may imply a proof of the infinitude of primes as well. Found that, I believe, back in 2010 -2011. All ironed it out but not an exactly an easy read; it can be written better, I just can't right now. The latest version is ... X.35.depq5
The real (actual) folder name is
"FERMAT(S) 3 approaches plus more"
Simon Roberts
affiliation : none.
Thanks and Thank You
59 (or 60) AND TE ONE FROM AUGUST 23 BOT INCORRECT OR WRONG, sorry.

Y.55.1 still stands out.