SF: Infinity proof
jstevh_at_msn.com
Date: 04/17/05
- Next message: mike: "Re: password derived key"
- Previous message: r.e.s.: "Re: DNA-Allele Analysis"
- Next in thread: José Carlos Santos: "Re: SF: Infinity proof"
- Reply: José Carlos Santos: "Re: SF: Infinity proof"
- Reply: David Kastrup: "Re: SF: Infinity proof"
- Reply: Bruce Stephens: "Re: SF: Infinity proof"
- Reply: oðin: "Re: Infinity proof"
- Reply: Tim Smith: "Re: SF: Infinity proof"
- Reply: Tim Peters: "Re: Infinity proof"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 17 Apr 2005 10:47:40 -0700
The surrogate factoring theorem works over rationals, and from
discussions I've seen on Usenet in response to my posts on SFT, it
seems there's a good bit of confusion possible when it comes to
understanding factoring in rationals.
The set of rational is infinite, and because every member except 0 is a
factor of every other member, math students get taught that
factorizations in rationals are trivial.
But if you have
a_1 a_2 = N
where a_1 and a_2 are rationals, and N is a composite, and further
a_1 = x/y
where x and y are coprime non-zero integers, then you can check the gcd
of x or y with N to see if you have a non-trivial factor of N.
So the factorization, while in rationals, can still be considered
non-trivial, if you do get a non-trivial factor from x or y.
So how many of the factors of N in the set of rationals are
non-trivial?
Well that's easy--an infinite number of them are.
But as a percentage, how many of them are trivial?
Well, for every trivial factor, you can multiply it by a prime factor
of N and get a non-trivial factor.
For instance, if N is coprime to 2 and 3, then x = 2, y = 3, gives 2/3,
a trivial factor of N. But if N has p_1 as a factor, then multiplying
x by p_1, gives a non-trivial factor as then you have 2p_1/3.
So for every trivial solution in that infinity you have a non-trivial
solution found by multiplying by a single prime factor.
So, as a percentage, at most 50% of the solutions are trivial for the
composite N.
Understanding that is key to understanding the importance of the SFT.
James Harris
- Next message: mike: "Re: password derived key"
- Previous message: r.e.s.: "Re: DNA-Allele Analysis"
- Next in thread: José Carlos Santos: "Re: SF: Infinity proof"
- Reply: José Carlos Santos: "Re: SF: Infinity proof"
- Reply: David Kastrup: "Re: SF: Infinity proof"
- Reply: Bruce Stephens: "Re: SF: Infinity proof"
- Reply: oðin: "Re: Infinity proof"
- Reply: Tim Smith: "Re: SF: Infinity proof"
- Reply: Tim Peters: "Re: Infinity proof"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|