Search results

Create the page "Prime number theorem" on this wiki! See also the search results found.

• Pocklington's theorem
  ...vented by H. C. Pocklington in 1914, which is a [[primality test]] for the number ''N'', states: ...v\,1\,\pmod{n}</math> and <math>gcd(a^{(N-1)/q}-1,N) = 1</math>, then each prime factor ''q'' of ''N'' has the form <math>q^kr+1</math>.
  2 KB (346 words) - 19:51, 30 August 2019
• Gerbicz error checking
  ...ts]], the technique is used to ensure validity of PRP tests for [[Mersenne number]]s: ...e programs and [[PRST]] in an extended version for PRP tests on additional number forms.
  3 KB (528 words) - 14:59, 3 October 2023
• Proth.exe
  '''Proth.exe''' is an ancient program that implements [[Proth's theorem]]. It is used to test the primality of the following forms: * {{Kbn|+|1|k|n}} ([[Generalized Fermat number]]s)
  667 bytes (101 words) - 16:44, 31 August 2021
• CRUS Liskovets-Gallot
  ...ctures]], which relate to the smallest [[Riesel prime|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of ...sted {{Vk}}-values (initially for [[Proth prime]]s, then also for [[Riesel prime]]s), divisible by 3, that had no primes of a given parity. This was proven
  7 KB (957 words) - 22:40, 10 June 2023

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)