![]() |
Available news archives:
comp.lang.tcl
-
comp.lang.python
-
comp.security.firewalls
-
sci.crypt -
comp.lang.php -
comp.lang.javascript
|
|
sci.crypt archiveJSH: Latest factoring idea, might work
From: <jstevh@msn.com>
Date: Sun Apr 30 2006 - 18:07:48 CEST
I have been fascinated by this very simple yet very powerful quadratic
What's weird here is that the freaking solution, is so freaking simple.
Because I found that the difference of factors of a composite are
But I puzzled over that for a while not seeing a way to easily factor
That is, if you have C, where C = p_1 p_2, then the difference of
But what if you multiply by ab, so you have ap_1 - bp_2 = 1?
Now you've forced the difference, but how do you find ab?
Well, my result lets you find ab mod n_1, where n_1 is some natural you
It's so damn obvious that it just seems too simple, even now.
I am looking for someone to shoot down my exposition of the method in
If there is nothing wrong with it, then someone searching could have a
If this idea does work, it will be the second method that I've
It is elegant in its own way though, and eventually I want to test it
Guess I could easily test this latest idea as well, but I just can't
I mean, if things were the way they are supposed to be, I should have
But things are messed up with current mathematicians fighting to keep
James Harris
|