Search the web
Sign In
New User? Sign Up
primeform · User group for PFGW & PrimeForm programs
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Want to share photos of your group with the world? Add a group photo to Flickr.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
GFN near mid-air collision   Message List  
Reply | Forward Message #7397 of 9809 |
Re: GFN near mid-air collision

--- In primeform@yahoogroups.com, "David Broadhurst"
<d.broadhurst@...> wrote:

> a[n] is smallest number such that
> (a+1)^(2^n)+1 and
> (a-1)^(2^n)+1 are both prime

I was lucky with a[11]. Up to n=12 the sequence is

3, 3, 3, 75, 113, 2163, 63739, 13221, 54809, 3656571,
6992033, 125441

assuming that Yves and I missed no smaller prime pairs.

(3+1)^(2^1)+1 is prime! (0.0023s+0.0078s)
(3-1)^(2^1)+1 is prime! (0.0023s+0.0094s)
(3+1)^(2^2)+1 is prime! (0.0027s+0.0089s)
(3-1)^(2^2)+1 is prime! (0.0024s+0.0078s)
(3+1)^(2^3)+1 is prime! (0.0027s+0.0091s)
(3-1)^(2^3)+1 is prime! (0.0024s+0.0070s)
(75+1)^(2^4)+1 is prime! (0.0241s+0.0103s)
(75-1)^(2^4)+1 is prime! (0.0071s+0.0077s)
(113+1)^(2^5)+1 is prime! (0.0127s+0.0096s)
(113-1)^(2^5)+1 is prime! (0.0072s+0.0078s)
(2163+1)^(2^6)+1 is prime! (0.0500s+0.0110s)
(2163-1)^(2^6)+1 is prime! (0.0162s+0.0073s)
(63739+1)^(2^7)+1 is prime! (0.0770s+0.0106s)
(63739-1)^(2^7)+1 is prime! (0.0767s+0.0074s)
(13221+1)^(2^8)+1 is prime! (0.2505s+0.0111s)
(13221-1)^(2^8)+1 is prime! (0.2479s+0.0096s)
(54809+1)^(2^9)+1 is prime! (1.2217s+0.0101s)
(54809-1)^(2^9)+1 is prime! (0.8976s+0.0080s)
(3656571+1)^(2^10)+1 is prime! (5.3727s+0.0108s)
(3656571-1)^(2^10)+1 is prime! (5.3709s+0.0076s)
(6992033+1)^(2^11)+1 is prime! (25.8867s+0.0139s)
(6992033-1)^(2^11)+1 is prime! (25.8388s+0.0064s)
(125441+1)^(2^12)+1 is prime! (50.1531s+0.0154s)
(125441-1)^(2^12)+1 is prime! (49.8836s+0.0073s)

David








Sat May 6, 2006 3:58 pm

djbroadhurst
Offline Offline
Send Email Send Email

Forward
Message #7397 of 9809 |
Expand Messages Author Sort by Date

Wow! How close can you get.... http://primes.utm.edu/primes/page.php?id=77690 99712838^16384+1 is prime! http://primes.utm.edu/primes/page.php?id=77689 ...
David Broadhurst
djbroadhurst
Offline Send Email
May 3, 2006
1:23 am

From: "David Broadhurst" <d.broadhurst@...> ... I know - I nearly collided with my floor when I saw that yesterday. Remembering that only even bases are...
Phil Carmody
thefatphil
Offline Send Email
May 3, 2006
8:20 am

... Close? these differ by 339824732360714867235790653[...130849 digits...]9000805700878318378218946562 <grin> But as to how close can you get, the bases...
Chris Caldwell
primemogul
Offline Send Email
May 3, 2006
2:00 pm

... {ngfn(n,mm)=local(ls);ls=[]; forstep(k=3,mm,2,if( length(ls)<10&& ispseudoprime((k+1)^(2^n)+1)&& ispseudoprime((k-1)^(2^n)+1), ...
David Broadhurst
djbroadhurst
Offline Send Email
May 3, 2006
2:37 pm

... and then [7, [63739]] to make the sequence 3, 3, 3, 75, 113, 2163, 63739 a[n] is smallest number such that (a+1)^(2^n)+1 and (a-1)^(2^n)+1 are both prime ...
David Broadhurst
djbroadhurst
Offline Send Email
May 3, 2006
3:03 pm

... According to Yves's tables, the sequence to n=10 is 3, 3, 3, 75, 113, 2163, 63739, 13221, 54809, 3656571 [Anyone care to check, please?] It seems from ...
David Broadhurst
djbroadhurst
Offline Send Email
May 3, 2006
3:58 pm

... You tried 8 right? I was hoping the value from 7 was unusually large and expected the value for 8 to be about that size. CC...
Chris Caldwell
primemogul
Offline Send Email
May 3, 2006
4:02 pm

... Oops, sorry for not reading to the bottom. These look better. Thanks...
Chris Caldwell
primemogul
Offline Send Email
May 3, 2006
4:04 pm

... a[12] is known: 3, 3, 3, 75, 113, 2163, 63739, 13221, 54809, 3656571, a[11], 125441 so a double-sieve for a[11] would be appreciated. Then we could try to...
David Broadhurst
djbroadhurst
Offline Send Email
May 3, 2006
4:24 pm

... I did a quick and dirty hack, running David Underbakke's AthGFNsieve, with Phil's "Wide-Range-Math", on b^2048+1 for even b in [4M,10M] to the (shallow)...
David Broadhurst
djbroadhurst
Offline Send Email
May 4, 2006
3:31 pm

... Rats! I think I lost a factor of 2 :-( Help please, some sane person like Phil or Jens: it now seems to me that I need 2*mu^2 lines, to give mu^2 possible...
David Broadhurst
djbroadhurst
Offline Send Email
May 4, 2006
7:35 pm

... I was lucky with a[11]. Up to n=12 the sequence is 3, 3, 3, 75, 113, 2163, 63739, 13221, 54809, 3656571, 6992033, 125441 assuming that Yves and I missed no...
David Broadhurst
djbroadhurst
Offline Send Email
May 6, 2006
3:58 pm

... I agree with your heuristics. When 2 lines are used per candidate pair (ignoring triples), the expectation is 2*mu^2 lines. The GFN's were untested when I...
Jens Kruse Andersen
jkand71
Offline Send Email
May 4, 2006
10:02 pm

... Thanks for that bad news, Jens :-) ... Yes, it would have been a /genuinely/ rare 2-constellation. [Info for interested bystanders: the elastic definition ...
David Broadhurst
djbroadhurst
Offline Send Email
May 4, 2006
10:40 pm

... From: David Broadhurst To: primeform@yahoogroups.com Sent: Saturday, May 06, 2006 5:58 PM Subject: [primeform] Re: GFN near mid-air collision ... I was...
Pierre CAMI
pierrecami
Offline Send Email
May 6, 2006
4:16 pm

... ..... There was no point in your finding ... since the factorizations ... should have been tested first, when we are hunting for a pair. I sieved all pairs...
David Broadhurst
djbroadhurst
Offline Send Email
May 6, 2006
4:57 pm
Advanced

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help