[QUOTE=CRGreathouse;228842]because I don't know what a general number is. [/QUOTE]

he still hasn't defined it well has he I'll look back through his lists to see if i can make sense of it.

Pi, I started work on a second number as soon as I finished the first. Your number shouldn't take too long, so you'll probably get a record before I smash it. :smile:

[QUOTE=science_man_88;228845]he still hasn't defined it well has he I'll look back through his lists to see if i can make sense of it.[/QUOTE]

Good luck. If you find an answer, post it -- and tell me if mine is OK.

[QUOTE=Charles]Pi, I started work on a second number as soon as I finished the first. Your number shouldn't take too long, so you'll probably get a record before I smash it.
[/QUOTE]

I dunno. I have to ensure PFGW does not have a primelimit to obey for trial factoring.

It is supposed to perform 71-72 billion divisions..

I don't think 71 to 72 billion divisions is going to finish anytime soon.. And, no, I'm not on the applet, I am using PFGW.

[QUOTE=3.14159;228847]I dunno. I have to ensure PFGW does not have a primelimit to obey for trial factoring.[/QUOTE]

I was thinking about that, trying to compute how much work you'd have to do and what tools you'd use, since pi(sqrt(3660797218706330586200749)) = 70,239,261,003 > 2[SUP]32[/SUP].

[QUOTE=3.14159;228847]It is supposed to perform 71-72 billion divisions.[/QUOTE]

Something like that. If that's literally true, it must only sieve to some limit, not quite up to the square root, for determining which 'primes' to use. This is safe, of course -- the extra nonprimes won't ever divide the number, just add to the running time. (Of course if testing the extra 1-2 billion numbers is shorter than doing the extra sieving to remove them, it's worthwhile.)

And, in the fractions, it shoots higher than 100%. Maybe the program is being confused by the factor limit value, due to it being too large?

So far, it's performed 2.9 billion divisions out of the 70.2 billion necessary to prove its primality.

My best guess is that it is dividing by any odd number, regardless of whether or not it is prime.

Here is what I observe: [code]F: 3660797218706330586200749 3335000000/2734577474 mro=0[/code]

[QUOTE=3.14159;228850]I don't think 71 to 72 billion divisions is going to finish anytime soon.. And, no, I'm not on the applet, I am using PFGW.[/QUOTE]

On a 3 GHz machine with a 30 cycle (throughput) division it would take 71.5e9*30/3e9 = 715 seconds for the division alone, if your number fit into a word (which it doesn't). Even with a factor of 20 allowance for multiprecision division, that's only 4 hours. If it takes an hour for the sieving the find the primes to use, that's just 5 hours.

Now this assumes a certain amount of optimization, but I'd certainly hope it finishes in a day.

[QUOTE=3.14159;228852]My best guess is that it is dividing by any odd number, regardless of whether or not it is prime.[/QUOTE]

That would take 956 billion trial divisions.

[QUOTE=Charles]On a 3 GHz machine with a 30 cycle (throughput) division it would take 71.5e9*30/3e9 = 715 seconds for the division alone, if your number fit into a word (which it doesn't). Even with a factor of 20 allowance for multiprecision division, that's only 4 hours. If it takes an hour for the sieving the find the primes to use, that's just 5 hours.
[/QUOTE]

It reaches a maximum point, then cycles over, each time with an increased trial factor bound. Is this going to continue until it reaches 70.2 billion?|

Here is what is being observed now:

[code]F: 3660797218706330586200749 440000000/3159943140 mro=0[/code]

[QUOTE=3.14159;228852]So far, it's performed 2.9 billion divisions out of the 70.2 billion necessary to prove its primality.[/QUOTE]

Ah, much better -- 70.2 billion is spot-on (see post #357).

So how long do you expect it to take, compared to your earlier efforts?

Mine should take about 24 hours, if I can trust the scaling. If I hit a bad breakpoint it could be as long as 48 hours.

Last time I used a single core of a slow computer. I make no guarantee that I will do either this time. :cool: