Order in the court!

Find the number of primes \(p\) such that \(q=2p-1\) is a prime and the following is true for all integers \(a\) from \(1\) to \(p-1\):

For every positive integer \(k\), if \(q\) divides \(a^k-1\), then \(p\) also divides \(a^k-1\).

×

Problem Loading...

Note Loading...

Set Loading...