Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2006-02-23, 21:40   #1
grandpascorpion's Avatar
Jan 2005

503 Posts
Default Primorial Sequence Question

Hello folks,

Sorry in advance for referring back to the Prime Puzzles website (specifically this week's puzzle:

In short, the puzzle is:

For each q=>2, find the smallest prime p such that p>q# & (p-r#) is prime for all prime r<=q.

Actually, I wrote something in PARI for this and have extended the table through p=37 but I was wondering if anyone had heard of prior work on this sequence. I did a cursory check of the Integer Sequences site but couldn't find this one.

To be honest, I'd be a little surprised if no one has worked on this curio before. The numbers are involved are tiny, relatively speaking.


Last fiddled with by grandpascorpion on 2006-02-23 at 21:43
grandpascorpion is offline   Reply With Quote
Old 2006-02-24, 01:59   #2
Citrix's Avatar
Jun 2003

23×197 Posts

GS, if you find a case for q=101, don't you eliminate all numbers below it?
Citrix is online now   Reply With Quote
Old 2006-02-24, 15:01   #3
grandpascorpion's Avatar
Jan 2005

1F716 Posts
Default Smallest prime

The puzzles asks for the smallest prime for each prime q.

The answer for q=101 would almost certainly be larger then q=97 or less.
grandpascorpion is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Largest Known Primorial a1call Miscellaneous Math 11 2016-12-14 21:35
Aliquot sequence convergence question philmoore Math 3 2009-03-20 19:04
Sequence Question davar55 Puzzles 20 2008-05-03 16:02
primorial primes jasong Math 1 2006-08-12 01:38
Primorial question Dougy Math 2 2005-07-28 13:13

All times are UTC. The time now is 01:52.

Sun Dec 6 01:52:10 UTC 2020 up 2 days, 22:03, 0 users, load averages: 3.05, 2.92, 2.76

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.