![]() |
|
|
#1 |
|
Mar 2018
53010 Posts |
Pg(k) numbers=(2^k-1)*10^d+2^(k-1)-1 where d is the number of decimal digits of 2^(k-1)-1.
For k>2, these are the values of k such that both Pg(k) and k are prime: 3,7,19,67,79,359,2131,3371,331259 These primes are all of the form 4*s+3, with s>=0. Can it be proven that if Pg(k) is prime and k is prime, then k must have the form 4*s+3? |
|
|
|
|
|
#2 |
|
Mar 2018
2·5·53 Posts |
Ok it can be easily proven...never mind!
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Odds of prime / expected # of primes | gd_barnes | Riesel Prime Search | 15 | 2010-10-14 22:00 |
| Prime-Digit Primes... | petrw1 | Puzzles | 10 | 2009-12-16 21:58 |
| prime distribution near mersenne primes | Unregistered | Homework Help | 43 | 2009-08-16 14:27 |
| Prime mod primes | Flatlander | Math | 2 | 2007-10-20 21:17 |
| possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |