2019-06-27, 12:31 | #1 |
Mar 2018
17·31 Posts |
Pg primes congruent to 1111 mod 42^2
pg numbers are so defined:
pg(k)=(2^k-1)*10^d+2^(k-1)-1 where d is the number of decimal digits of 2^(k-1)-1. pg(8), pg(176006) and pg(541456) are probable primes. They are cogruent to 19 mod (42) and to 1111 mod(42^2). Do you believe these primes are infinitely many? primes pg congruent to 19 mod 42 and to 1111 (mod 42^2)? |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Distribution of Mersenne primes before and after couples of primes found | emily | Math | 34 | 2017-07-16 18:44 |
Another interesting pattern of Mersenne exponents: they are prime!!!!1111 | ProximaCentauri | Miscellaneous Math | 22 | 2014-12-05 13:07 |
((my) mod n ) congruent to n-1 | smslca | Math | 2 | 2012-01-29 11:30 |
mathematica7.0 can easily factorize 10^67+1111 | aaa120 | Factoring | 14 | 2008-12-07 13:14 |
possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |