[math-fun] Wilson a^2+b^2-c^2 Conjecture
computer output if anybody wants to look at it: https://dl.dropboxusercontent.com/u/3507527/WilsonConj.out (do text search for the letter e) By the way, if anybody cared the runtime could probably be reduced from order N^2 to order N roughly, by doing a less-brute search for primes, i.e. only trying primes that might plausibly work to fill in holes in the current table of represented N. If that were done, you might be able to confirm Wilson out to N=10^10. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)
Choose A = 3N+2, B = 4N. A2 + B2 = 25N2 + 12N + 4 floor(sqrt(RHS)) = 5N+1 if N>0 put C = 5N+1, C2 = 25N2 + 10N + 1 A2 + B2 - C2 = 2N + 3. This represents all odd numbers >4. Rich ------------- Quoting Warren D Smith <warren.wds@gmail.com>:
computer output if anybody wants to look at it:
https://dl.dropboxusercontent.com/u/3507527/WilsonConj.out
(do text search for the letter e) By the way, if anybody cared the runtime could probably be reduced from order N^2 to order N roughly, by doing a less-brute search for primes, i.e. only trying primes that might plausibly work to fill in holes in the current table of represented N. If that were done, you might be able to confirm Wilson out to N=10^10.
-- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
Choose A = 3N-1, B = 4N+1. Then A2+B2 = 25N2 + 2N + 2, C = 5N, A2+B2-C2 = 2N+2. This represents all even numbers >3. Together with Warren's work, taking care of the small cases, we're done. -------- Quoting rcs@xmission.com:
Choose A = 3N+2, B = 4N. A2 + B2 = 25N2 + 12N + 4 floor(sqrt(RHS)) = 5N+1 if N>0 put C = 5N+1, C2 = 25N2 + 10N + 1 A2 + B2 - C2 = 2N + 3. This represents all odd numbers >4.
Rich
------------- Quoting Warren D Smith <warren.wds@gmail.com>:
computer output if anybody wants to look at it:
https://dl.dropboxusercontent.com/u/3507527/WilsonConj.out
(do text search for the letter e) By the way, if anybody cared the runtime could probably be reduced from order N^2 to order N roughly, by doing a less-brute search for primes, i.e. only trying primes that might plausibly work to fill in holes in the current table of represented N. If that were done, you might be able to confirm Wilson out to N=10^10.
-- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
participants (2)
-
rcs＠xmission.com -
Warren D Smith