GENERALIZED MERSENNE PRIME

Given a prime order k, choose a prime modulus p such that R(k,p) = ((p^k)-1)/(p-1) is also a prime number

Enter k and select the number of bits to get the value p = (2^no of bits) -1



Please input k:



Please choose the type of primes: NSG Primes SG Primes



Please choose bit: 31bits 63bits 64bits 127bits 128bits