[QUOTE=CRGreathouse]In a pinch, I suppose that works. You just test the remainder for primality of n+1, I suppose?
[/QUOTE]

I suppose that might work.

back to post 885 around this post I wanted to know when 2^recurrence just like the recurrence of the Mersenne numbers-1 for a specific start number etc. I find 11 a start number that seemed to work up to the known height of Mersenne exponents. wonder if anyone can tell me the odds.

See [url]http://primes.utm.edu/notes/faq/NextMersenne.html[/url]

[QUOTE=CRGreathouse;227585]See [url]http://primes.utm.edu/notes/faq/NextMersenne.html[/url][/QUOTE]

not quite what I meant CRG. what I mean't was the sequence 11,23,47,95,......

which has the same recurrence as the Mersenne numbers at an exception in the exponents seems to never come across a prime exponent that works to be a Mersenne prime exponent. I had a code to try this out when you asked for a sequence but I'll have to figure it out again lol.

[QUOTE=science_man_88;227588]not quite what I meant CRG. what I mean't was the sequence 11,23,47,95,......

which has the same recurrence as the Mersenne numbers at an exception in the exponents seems to never come across a prime exponent that works to be a Mersenne prime exponent. I had a code to try this out when you asked for a sequence but I'll have to figure it out again lol.[/QUOTE]

You're going to need to learn to be more explicit. I still don't know what you mean because you're [i]actually not telling me[/i].

[QUOTE=CRGreathouse]You're going to need to learn to be more explicit. I still don't know what you mean because you're actually not telling me.
[/QUOTE]

By the way: Have you discovered any primes of any significant size, for items 1-19?

[CODE]for(s=1,50,for(x=s,20000000*s,print1(x",");x=x*2);print(""))[/CODE]

this should help your memory CRG.

Also: Is there any database for all the k-b-b primes? If so, can you link me to it? If not, I'll start my own via a new thread. I will begin where b > 60. I don't wish to waste time looking for small primes.

Okay: Using prime k-b-b: For b =2; The 4n + 1 primes (Pythagorean primes)
b = 3; 27n + 1 primes.
b = 5: 3125n + 1 primes.

Etc, etc.

If there isn't one already: I'll search for k-b-b; k = 1 to 10[sup]4[/sup]

Also: Correct b > 60 to b ≥ 60.

[QUOTE=3.14159;227590]By the way: Have you discovered any primes of any significant size, for items 1-19?[/QUOTE]

I haven't looked for any except #16. Well, technically I'm looking for a prime of the form 2^n-2293 which fits into a few of your categories, but that's been going on for a while now, it's not prompted by your categories.

[QUOTE=CRGreathouse]Well, technically I'm looking for a prime of the form 2^n-2293 which fits into a few of your categories, but that's been going on for a while now, it's not prompted by your categories.[/QUOTE]

What's your n-range?

Alternatively: What size are you aiming for? Is it top 5000 worthy?

Also: Reply concerning Posts 1130 and 1131?

Apologies if I came off as a bit inquisitive here.