mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > enzocreti

Reply
 
Thread Tools
Old 2019-05-17, 09:30   #1
enzocreti
 
Mar 2018

53010 Posts
Default Pg(k) primes with k prime

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?
enzocreti is offline   Reply With Quote
Old 2019-05-17, 11:06   #2
enzocreti
 
Mar 2018

2·5·53 Posts
Default Proof

Ok it can be easily proven...never mind!
enzocreti is offline   Reply With Quote
Reply

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

All times are UTC. The time now is 04:44.


Sat Jul 17 04:44:53 UTC 2021 up 50 days, 2:32, 1 user, load averages: 2.63, 2.27, 2.21

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.