mersenneforum.org > Math Prime Factoring Algorithm
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2008-04-08, 03:08   #1
Visu

Nov 2006
Singapore

3×52 Posts
Prime Factoring Algorithm

Looking for comments/criticisms before I proceed further. The idea seems (at least to me) too promising to abandon but as of now is still "half baked".I am hoping other eyes and brains can help me see the things that I have missed.

Visu
Attached Files
 Prime_Factoring_Algorithm_Updated_Ver1_1_2.pdf (80.8 KB, 338 views)

Last fiddled with by Visu on 2008-04-08 at 03:10

2008-04-08, 12:11   #2
R.D. Silverman

Nov 2003

22×5×373 Posts

Quote:
 Originally Posted by Visu Looking for comments/criticisms before I proceed further. The idea seems (at least to me) too promising to abandon but as of now is still "half baked".I am hoping other eyes and brains can help me see the things that I have missed. Visu
Useless. Even if it works in all cases it is no better than trial division
of Fermat's method.

 2008-04-10, 15:01 #3 Visu     Nov 2006 Singapore 3×52 Posts Trial division? There is no trial division anywhere.
2008-04-10, 15:08   #4
retina
Undefined

"The unspeakable one"
Jun 2006
My evil lair

52·229 Posts

Quote:
 Originally Posted by Visu Trial division? There is no trial division anywhere.
One would imagine that your method was being compared to trial division.

 2008-04-10, 17:22 #5 ewmayer ∂2ω=0     Sep 2002 República de California 1151810 Posts Bit late to the party, and have a possibly-very-stupid question, which is orthogonal to the estimated-runtime discussion: Why do we need a "prime factoring algorithm"?
2008-04-10, 21:19   #6
wblipp

"William"
May 2003
New Haven

1001001101102 Posts

Quote:
 Originally Posted by ewmayer Why do we need a "prime factoring algorithm"?
To sell to Bill Gates. From his book "The Road Ahead"

"The obvious mathematical breakthrough would be development of an easy way to factor large prime numbers."

 2008-04-10, 21:38 #7 wblipp     "William" May 2003 New Haven 2·32·131 Posts Have you tried your method on the Zimmermann challenges? Paul Zimmermann's page: "If you want me to look at your algorithm, please first factor one of the numbers below. These small challenges are hard enough so that naive algorithms will not be able to solve them, and easy enough so that an implementation on a personal computer should be able to solve them (if the corresponding algorithm is really efficient)." http://www.loria.fr/~zimmerma/records/rsa.html
2008-04-10, 22:29   #8
Visu

Nov 2006
Singapore

3×52 Posts

Quote:
 Originally Posted by wblipp Have you tried your method on the Zimmermann challenges? Paul Zimmermann's page: "If you want me to look at your algorithm, please first factor one of the numbers below. These small challenges are hard enough so that naive algorithms will not be able to solve them, and easy enough so that an implementation on a personal computer should be able to solve them (if the corresponding algorithm is really efficient)." http://www.loria.fr/~zimmerma/records/rsa.html
Not yet. I am a pre school level programmer and wanted to make sure there were no errors in the mathematics and reasoning before committing the next two years of my life writing the necessary programme.

2008-04-10, 22:35   #9
Visu

Nov 2006
Singapore

3×52 Posts

Quote:
 Originally Posted by ewmayer Bit late to the party, and have a possibly-very-stupid question, which is orthogonal to the estimated-runtime discussion: Why do we need a "prime factoring algorithm"?
Ha ha. Because I was too lazy to write "An algorithm to factorise semiprimes into their constituent prime numbers or verify that a given number is a prime".

I could have just called it a factoring algorithm though

And seems I'm in good company if Bill Gates is making the same mistake I did in a more public forum. We non mathematicians have a lot to learn.

2008-04-10, 22:41   #10
Visu

Nov 2006
Singapore

3×52 Posts

Quote:
 Originally Posted by retina One would imagine that your method was being compared to trial division.
I thought for a minute that some requirement for trial division managed to sneak in. I was fairly certain that I left out trial divisions, iterations that loop indefinitely and sievings the usual road bumps in the way of an amateur mathematicians' road to glory. ( I might have divided something by 0 though.)

2008-04-10, 22:44   #11
Uncwilly
6809 > 6502

"""""""""""""""""""
Aug 2003
101×103 Posts

112×71 Posts

Quote:
 Originally Posted by Visu Not yet. I am a pre school level programmer and wanted to make sure there were no errors in the mathematics and reasoning before committing the next two years of my life writing the necessary programme.
My understanding is that Mathematica or other program can be used to perform the need calculations.

 Similar Threads Thread Thread Starter Forum Replies Last Post Prime95 Miscellaneous Math 72 2015-10-26 00:14 Citrix Factoring 37 2008-08-16 14:19 Citrix Factoring 6 2007-12-23 11:36 TheJudger Math 4 2007-10-18 19:01 Visu Factoring 22 2006-11-09 10:43

All times are UTC. The time now is 08:08.

Fri Sep 18 08:08:39 UTC 2020 up 8 days, 5:19, 0 users, load averages: 1.62, 1.58, 1.57