Cryptography, Python, Math, Mathematics, Diffie Hellman.
12,322,846,688,760,936,252,042,622,733 and k = 1. Let a = 8,625,146,190,036,362,446,236,062,645. Therefore, b = a^m (mod n) = 1. Since 1 modulo n = b modulo n, we can say that b ≡ ±1 (mod n). Therefore, n is pseudoprime. Part 2: Find if (n-1)/2 Is Pseudoprime or Composite Let x = (n-1)/2 =