[QUOTE=smh;253388]Why does it such small batches?[/QUOTE]

Because I don't want to overload the server... :smile:
It's still in beta (alpha?) testing.

Luigi

[QUOTE=CedricVonck;253390]I have another issue ... when I click a random number, Firefox always says: 'No factor found' before returning to the startpage :question:[/QUOTE]

You've not been lucky...
When you find a factor, the server answers "Factor found : xxxxxxx" before loading the startpage.

Luigi

P.S. I noticed that someone has already discovered a more-than-57-bit factor!
P.P.S. Maybe I'll have to insert some new exponent to the queue...

[QUOTE=firejuggler;253389]34.5850 bits , k=3
35.0000 bits, k= 4
35.3219 bits, k=5
35.8074 bits, k=7
.....
55.3532 bits, k= 5357831
57.0992 bits, k=2^3*7 * 320923
hmmm pm1 would have been a better method there[/QUOTE]

Written in php, with less than 50 lines of code, and running in batches of 3-4 seconds? I doubt it... :smile:

Luigi

[QUOTE=ET_;253397]Written in php, with less than 50 lines of code, and running in batches of 3-4 seconds? I doubt it... :smile:[/QUOTE]
Is this a machine that you have full time control over? Or have you figure out a way to get time on this machine by doing "fancy webpages"?

Suggestion:
Add a button to the right of the stats that says something like "Test a 'Random' number from the list".
Have it find the number with the lowest 'k' that has no known factor and test it.

What is the significance of the range?

mfaktc can only test TF up to 2^32-1. After, you have to use either factor5 (which is much slower) or use ET_ applet, which doesn't move fast either,but can help you relieve your boredoom, as each test take 4 or 5 seconds.
an other reason could be to see how evolve k in that range , its distribution... or will edington interest in 'large' mersenne factor. Or, even less probable, just a challenge in PHP, and revelant to the interest of ET?

[QUOTE=Uncwilly;253406]Is this a machine that you have full time control over? Or have you figure out a way to get time on this machine by doing "fancy webpages"?

Suggestion:
Add a button to the right of the stats that says something like "Test a 'Random' number from the list".
Have it find the number with the lowest 'k' that has no known factor and test it.[/QUOTE]

That's a good point, especially when the list grows up! :smile:
I hope I can add it next Friday.

Luigi

[QUOTE=Uncwilly;253424]What is the significance of the range?[/QUOTE]

I started from where mfaktc stops.

Luigi

[QUOTE=firejuggler;253447]Another reason could be to see how evolve k in that range , its distribution... or will edington interest in 'large' mersenne factor. Or, even less probable, just a challenge in PHP, and revelant to the interest of ET?[/QUOTE]

All your guesses are exact... :smile:

Luigi

are factors shown incorrectly ?
 

factors in the exponent table are not equal to 2kp+1. Am I wrongly interpreting your table ? For instance in the second row:
for P=4294967357 you list K=35000535 and Factor=34359738857,
but if I am not mistaken, this factor gives a k value of 4.
Can you tell me where I am wrong?

[QUOTE=ppo;253542]factors in the exponent table are not equal to 2kp+1. Am I wrongly interpreting your table ? For instance in the second row:
for P=4294967357 you list K=35000535 and Factor=34359738857,
but if I am not mistaken, this factor gives a k value of 4.
Can you tell me where I am wrong?[/QUOTE]

For the bit depth of factors you should check [URL="http://www.moregimps.it/mersenne-test/factors.php"]here[/URL] :smile:

The exponents table shows how deep each exponent has been trial-factored.

Luigi