QR-koodi

A primality test for Kpⁿ⁺¹ numbers and a generalization of Safe primes and Sophie Germain primes

In this paper, we provide a generalization of Proth's theorem for integers of the form Kpⁿ⁺¹. In particular, a primality test that requires a modular exponentiation (with a proper base a) similar to that of Fermat's test without the computation of any GCD's. We also provide two tests to increase the...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijä: Abdelrahman Ramzy
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences 2023-02-01
Sarja:Notes on Number Theory and Discrete Mathematics
Aiheet:
Linkit:https://nntdm.net/papers/nntdm-29/NNTDM-29-1-062-077.pdf
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!