mersenneforum.org Factoring details
 Register FAQ Search Today's Posts Mark Forums Read

 2013-02-07, 22:07 #1 mturpin   Feb 2013 18 Posts Factoring details I am wondering what the following means: "Trial factoring M82611773 to 2^68 is 82.77% complete. Time:374.213 sec." M82611773 must be 2^82611773-1, the number being tested for primality? Is the program checking all factors n < 2^68? Is the time a cumulative time, or since the last message? Thanks for any help.
 2013-02-07, 22:23 #2 firejuggler     Apr 2010 Over the rainbow 22×641 Posts primality? no, just factors (at this point). fator n<2^68? not exactly.. All mersenne factor are of the form 2*k*p+1 where p is 82611773 in your case. what is tested is the value of k wich make 2*k*p+1 <2^68... k being an integer, equal or above 1. as for the time it is since the last message. Last fiddled with by firejuggler on 2013-02-07 at 22:24
2013-02-07, 23:28   #3
Mr. P-1

Jun 2003

7×167 Posts

Quote:
 Originally Posted by firejuggler primality? no, just factors (at this point).
To clarify, the number will eventually be tested for primality (by you or someone else), if no factor is found.

To find out whether the person who will do the primality test will be you or someone else, look in your worktodo.txt file. If the line with that exponent begins with "Test=" or "Doublecheck=", they you will do the primality test. If it begins with "Factor=", then you're only doing the factoring stage.

2013-02-08, 01:33   #4
Uncwilly
6809 > 6502

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

100101010101112 Posts

Quote:
 Originally Posted by mturpin "Trial factoring M82611773 to 2^68 is 82.77% complete. Time:374.213 sec." M82611773 must be 2^82611773-1, the number being tested for primality? Is the program checking all factors n < 2^68? Is the time a cumulative time, or since the last message?
As explained above, yes M82611773 is 2^82611773-1
The factors of Mersenne numbers can only be in the form 2*k*p+1
Your machine is testing for numbers in the range between 2^67 and 2^68. The report is stating that you are 82.77% of the way through that. 374.213 seconds (wall clock time) have elapsed since the last status update.

The trial factoring that you are doing is the fastest way to eliminate as many candidates as possible. The starting list of candidates is all prime numbers for the exponent. About 50% are quickly eliminated by trial factoring to low bit levels. Then about 10-15% more are eliminated by more trial factoring and 'P-1' testing. Those numbers that remain are then tested for primality. This test takes much longer, but will not find any factors.

 2013-02-08, 02:43 #5 LaurV Romulan Interpreter     Jun 2011 Thailand 25×5×59 Posts For more details, please see the math page on GIMPS server.

 Similar Threads Thread Thread Starter Forum Replies Last Post VictordeHolland Hardware 0 2015-04-24 14:49 dufrenbk Information & Answers 3 2013-03-23 22:02 Death Math 10 2011-08-03 13:49 Unregistered Information & Answers 2 2010-10-25 20:23 schneelocke PrimeNet 3 2004-01-07 22:12

All times are UTC. The time now is 05:29.

Sun May 9 05:29:46 UTC 2021 up 31 days, 10 mins, 0 users, load averages: 1.65, 1.67, 1.60