Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911835188363264 |
|---|---|
| author | Dougherty-Bliss, Robert Zeilberger, Doron |
| author_facet | Dougherty-Bliss, Robert Zeilberger, Doron |
| contents | We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality tests for which we can explicitly construct infinite families of pseudo-primes, rather, like in the cases of Perrin pseudo-primes and the famous Carmichael primes, only proving the mere existence of infinitely many of them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_16069 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes Dougherty-Bliss, Robert Zeilberger, Doron Number Theory Combinatorics We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality tests for which we can explicitly construct infinite families of pseudo-primes, rather, like in the cases of Perrin pseudo-primes and the famous Carmichael primes, only proving the mere existence of infinitely many of them. |
| title | Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes |
| topic | Number Theory Combinatorics |
| url | https://arxiv.org/abs/2307.16069 |