mersenneforum.org > Math division/remainder algorithm (trial factoring)
 Register FAQ Search Today's Posts Mark Forums Read

2007-10-17, 20:52   #2
R.D. Silverman

Nov 2003

22·5·373 Posts

Quote:
 Originally Posted by TheJudger Hello, can somebody give me a hint how to calculate a division / remainder with software integers in an efficent way? Size of the numbers: up to ~80/160 bits (Trialfactoring of factors up to ~80 bits) ...

Knuth, The Art of Computer Programming, Vol II

 2007-10-18, 03:18 #3 ShiningArcanine     Dec 2005 22·23 Posts Why not just use GMP and test a different number in each thread? You could be doing 768 tests in parallel. Last fiddled with by ShiningArcanine on 2007-10-18 at 03:19
2007-10-18, 13:59   #4
R.D. Silverman

Nov 2003

746010 Posts

Quote:
 Originally Posted by ShiningArcanine Why not just use GMP and test a different number in each thread? You could be doing 768 tests in parallel.
We must have read different posts. I could swear that the O.P. asked
"how to calculate" and not "what code do I use".

2007-10-18, 19:01   #5
TheJudger

"Oliver"
Mar 2005
Germany

11·101 Posts

Quote:
 Originally Posted by ShiningArcanine Why not just use GMP and test a different number in each thread? You could be doing 768 tests in parallel.
Yes, that's what I want to do.. test alot of possible factors for a single exponent at the same time.

I'm pretty sure the GMP won't fit to the limitations...

 Similar Threads Thread Thread Starter Forum Replies Last Post yih117 Math 5 2018-02-02 02:49 mathPuzzles Math 8 2017-04-21 07:21 Peter Hackman Factoring 7 2009-10-26 18:27 SPWorley Math 8 2009-08-24 23:26 ewmayer Factoring 7 2008-12-11 22:12

All times are UTC. The time now is 06:11.

Sun May 29 06:11:41 UTC 2022 up 45 days, 4:13, 0 users, load averages: 1.74, 1.64, 1.43