Though, you could not begin with 2^1; You would have to begin with 2^16.

And; Have there been any new decent-sized primes for PrimeGrid lately?

Also, MultiSieve has two useless options (Neither will yield any new primes):

1. Factorial (n! + 1)
2. Primorial (p(n)# + 1)

It is only useful for Generalized Cullen/Woodall numbers.

[QUOTE=3.14159;231430]Though, you could not begin with 2^1; You would have to begin with 2^16.
[/quote]

What does it mean?

[quote]
And; Have there been any new decent-sized primes for PrimeGrid lately?[/QUOTE]

See [url=http://primes.utm.edu/primes/status.php?hours=12]here[/url]: all +1-primes are PG's.

[QUOTE=Karsten]What does it mean?
[/QUOTE]

b = 2; n would have to begin at 16, to avoid defiance of the Proth rule.

Top 5k is now 165800 decimal digits.

I'm going to start testing; And, I will save a copy, to save checkpoints.

[QUOTE=3.14159;231434]b = 2; n would have to begin at 16, to avoid defiance of the Proth rule.[QUOTE]

Your rule?

k=2^n+1 is prime for n<16:
k=1: 1, 2, 4, 8
k=3: 1, 2, 5, 6, 8, 12
k=5: 1, 3, 7, 13, 15
k=7: 2, 4, 6, 14
k=9: 1, 2, 3, 6, 7, 11, 14

and so on.

Karsten:

Are you doing any search work or factor work at the moment?

Also, based on the testing time, I should find something within 65 days' worth of work. Since I am restricted to only about 1/2 day, I expect something in 4-6 months.

Therefore, no more records for the rest of this year. And, dammit, I won't make it to the top 5k. The time it takes to test and the odds always prohibit me from finding anything that would be top-5000 worthy.

I don't know if it would be faster or slower to be in a group project, but even if it were faster, if I were to discover anything, the group gets the credit.

one thing I found on top of them all seeming to end in 1, they all seem to have a digital sum of 1. what can we say about this groups primality.

[QUOTE=3.14159;231440]
I don't know if it would be faster or slower to be in a group project, but even if it were faster, if I were to discover anything, the group gets the credit.[/QUOTE]

[url]http://en.wikipedia.org/wiki/Mersenne_prime[/url]

why does this list individuals from GIMPS then ?

[QUOTE=3.14159;231431]Also, MultiSieve has two useless options (Neither will yield any new primes):

1. Factorial (n! + 1)
2. Primorial (p(n)# + 1)

It is only useful for Generalized Cullen/Woodall numbers.[/QUOTE]

?

Since PrimeGrid is extending the bounds of the Factorial/Primorial searches with code written by myself and Geoff Reynolds, these options aren't particularly useful. MultiSieve hasn't been updated in years.

Note that MultiSieve does not output primes, only numbers that have unknown primality.

[QUOTE=Rogue]Since PrimeGrid is extending the bounds of the Factorial/Primorial searches with code written by myself and Geoff Reynolds, these options aren't particularly useful. MultiSieve hasn't been updated in years.
[/QUOTE]

If I'm not mistaken; it's been 4-6 years.

Also: k * n! + 1 or k * p(n)# + 1 would be more practical. (There would have to be some simple restrictions, however. If not, every prime could be one of these.)

I think an ideal restriction for both would be : k ≤ n! or k ≤ p(n)#.

[QUOTE=Rogue]Note that MultiSieve does not output primes, only numbers that have unknown primality.
[/QUOTE]

Knew that before.

if I did my math right the sequence the k*b^b+1 fall in for 5*6n^6n +1 would represent about 1% of numbers if tried against the % for primes what are the odds that the 2 meet.