Re: JSH: A solution to the factoring problem
- From: "Rosco" <nospam@xxxxxxxxxx>
- Date: Sat, 26 Jan 2008 10:57:40 -0600
"JSH" <jstevh@xxxxxxxxx> wrote in message
news:27e74885-7081-421f-8c95-b96e4c135db8@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
On Jan 26, 3:26 am, Gib Bogle <bo...@xxxxxxxxxxxxxxxxxxxxxxxx> wrote:
JSH wrote:
I've discovered some remarkably simple congruences that give f_1 mod p
and f_2 mod p, 75% of the time, when f_1*f_2 = nT, where T is a
composite you wish to factor, p is a prime of your choice and n is a
non-zero integer of your choice:
Excellent. Now all you need to do to convince people is factor a large
number.
An example versus proof?
How funny, and how ironic.
I've proven a solution to the factoring problem and so far have
disdained dramatic demonstration.
You can doubt mathematical proof, but later, as there is no way this
result will not get known, I'll note the behavior of math society with
what may be one of the most important mathematical finds in its
history, to argue for the necessity of real policing of the
mathematical community, and significant change.
You sound like an old woman.
Now factor a number with it, which will show us it may work.
Smoke and mirrors doesn't work in Math.
.
- References:
- Re: JSH: A solution to the factoring problem
- From: Gib Bogle
- Re: JSH: A solution to the factoring problem
- From: JSH
- Re: JSH: A solution to the factoring problem
- Prev by Date: Re: JSH: A solution to the factoring problem
- Next by Date: How to Replicate NoEinstein's M-M Invalidation (is Copyrighted.)
- Previous by thread: Re: JSH: A solution to the factoring problem
- Next by thread: Re: JSH: A solution to the factoring problem
- Index(es):
Relevant Pages
|