|
2013-07-20, 12:23
|
#1 |
Dec 2008
you know...around...
10100111102 Posts |
Primitive roots for a set of primes
Given a prime constellation, is there a sleight of hand way to find out about the (smallest) possible value(s) n such that it is possible to find a corresponding set of primes P such that for every prime p
Example: prime quadruplet [p, p+2, p+6, p+8] --> n = 11, 19, 22, 23, 26, 31, 34 ... (e.g. for n=11, p=300491 (among others) can be found; there is no such p for n<11) |
|
|
 |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| primitive roots- when the base is a quadratic algebraic integer | devarajkandadai | Number Theory Discussion Group | 0 | 2018-02-08 05:15 |
| efficient generation of highly non-primitive roots | vector | Math | 7 | 2007-11-14 16:07 |
| Primitive Roots | Numbers | Math | 16 | 2005-09-21 23:41 |
| Is 3 always a primitive root for mersenne primes? | juergen | Math | 12 | 2005-03-09 08:18 |
| Is 3 always a primitive root for mersenne primes? | juergen | Programming | 9 | 2005-03-08 03:51 |
