How to Use LLR

[PawnProver44]

Pfgw takes too much time and if I am correct, would not be the fastest program for finding primes for the top5000 in the Prime Pages. (Well, LLR should be faster, but Pfgw can still apply the N+/-1 tests anyways.) So does anyone know how to use LLR, say for finding large million digit primes of the form k*b^n+/-1, with b and n fixed. under a week say. Or please let me know if there is another program I can use more efficient and less memory.

[rogue]

Originally Posted by PawnProver44

Pfgw takes too much time and if I am correct, would not be the fastest program for finding primes for the top5000 in the Prime Pages. (Well, LLR should be faster, but Pfgw can still apply the N+/-1 tests anyways.) So does anyone know how to use LLR, say for finding large million digit primes of the form k*b^n+/-1, with b and n fixed. under a week say. Or please let me know if there is another program I can use more efficient and less memory.

LLR has a readme. Read it!

Unless extremely lucky, you will not find a million digit prime in a week or even a month.

[VBCurtis]

Originally Posted by rogue

LLR has a readme. Read it!

Unless extremely lucky, you will not find a million digit prime in a week or even a month.

So does this subforum. It's like people knew new users would need directions... it's even stickied, though the sticky list is lengthy so you might have to laboriously scroll down like 5 lines.

I'll take the over on a month to find a megadigit, if using <20 cores.

[PawnProver44]

Trust me, I would have already looked there, but the lines are too complicated to keep scrolling down.

[rebirther]

Originally Posted by PawnProver44

Trust me, I would have already looked there, but the lines are too complicated to keep scrolling down.

If you want easily to start with llr you could attach to my SRBase BOINC project. Install BOINC and choose your difficulty sub project.

[rogue]

Originally Posted by PawnProver44

Trust me, I would have already looked there, but the lines are too complicated to keep scrolling down.

Almost everything you have posted tells me that you are lazy.

[wombatman]

Originally Posted by rogue

Almost everything you have posted tells me that you are lazy.

Or a troll.

[pepi37]

Originally Posted by PawnProver44

Pfgw takes too much time and if I am correct, would not be the fastest program for finding primes for the top5000 in the Prime Pages. (Well, LLR should be faster, but Pfgw can still apply the N+/-1 tests anyways.) So does anyone know how to use LLR, say for finding large million digit primes of the form k*b^n+/-1, with b and n fixed. under a week say. Or please let me know if there is another program I can use more efficient and less memory.

Yes , when someone write that program ( for finding above milion digit prime number in few weeks) then, please send me copy, I would like to find a ten or more... just for fun :)

Seriously ,after so many posts you ask same questions again? In meantime of you brilliant mind working, did you find prime with lets say 400.000 digits?
With every new post your dig for yourself bigger hole

[science_man_88]

Originally Posted by PawnProver44

say for finding large million digit primes of the form k*b^n+/-1, with b and n fixed. under a week say.

if it was that easy with just 100 people working the form it would replace the top 5000 in under a year.

[PawnProver44]

sorry guys i get it. you think i am lazy but I am
"not, not, not a troll"
"I am not a troll"

Here is my largest known prime I ever found:

(Which is not a prp): http://factordb.com/index.php?id=1100000000827275595

(correction: I just used a random prime generator, so I basically chaeated, along with this one: http://factordb.com/index.php?id=1100000000676234871) which is currently the largest prime I ever found with 5,122 digits.

I never made it to Henri Lifchitz's PRP top.

[science_man_88]

Originally Posted by PawnProver44

sorry guys i get it. you think i am lazy but I am
"not, not, not a troll"
"I am not a troll"

Here is my largest known prime I ever found:

(Which is not a prp): http://factordb.com/index.php?id=1100000000827275595

(correction: I just used a random prime generator, so I basically chaeated, along with this one: http://factordb.com/index.php?id=1100000000676234871) which is currently the largest prime I ever found with 5,122 digits.

I never made it to Henri Lifchitz's PRP top.

you would have to take that first one to roughly the 298th power to get a 1 million decimal digit number. edit: even the second one would have to be taken to roughly the 196th power to make it over 1 million digits.