![]() |
![]() |
#1 |
Jan 2005
Transdniestr
503 Posts |
![]()
Hello folks,
Sorry in advance for referring back to the Prime Puzzles website (specifically this week's puzzle: http://www.primepuzzles.net/puzzles/puzz_350.htm) 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. Thanks, Grandpa Last fiddled with by grandpascorpion on 2006-02-23 at 21:43 |
![]() |
![]() |
![]() |
#2 |
Jun 2003
62B16 Posts |
![]()
GS, if you find a case for q=101, don't you eliminate all numbers below it?
|
![]() |
![]() |
![]() |
#3 |
Jan 2005
Transdniestr
503 Posts |
![]()
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. |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
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 |