mersenneforum.org  

Go Back   mersenneforum.org > New To GIMPS? Start Here! > Information & Answers

Reply
 
Thread Tools
Old 2013-02-07, 22:07   #1
mturpin
 
Feb 2013

18 Posts
Default 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.
mturpin is offline   Reply With Quote
Old 2013-02-07, 22:23   #2
firejuggler
 
firejuggler's Avatar
 
Apr 2010
Over the rainbow

22×641 Posts
Default

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
firejuggler is offline   Reply With Quote
Old 2013-02-07, 23:28   #3
Mr. P-1
 
Mr. P-1's Avatar
 
Jun 2003

7×167 Posts
Default

Quote:
Originally Posted by firejuggler View Post
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.
Mr. P-1 is offline   Reply With Quote
Old 2013-02-08, 01:33   #4
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

100101010101112 Posts
Default

Quote:
Originally Posted by mturpin View Post
"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.
Uncwilly is offline   Reply With Quote
Old 2013-02-08, 02:43   #5
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

25×5×59 Posts
Default

For more details, please see the math page on GIMPS server.
LaurV is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
ARM reveals Cortex A72 details VictordeHolland Hardware 0 2015-04-24 14:49
Days to-go in computer details is a negative number dufrenbk Information & Answers 3 2013-03-23 22:02
Euler (6,2,5) details. Death Math 10 2011-08-03 13:49
Computer details showing wrong info Unregistered Information & Answers 2 2010-10-25 20:23
"Factoring only" results / stats in account details page 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

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.