vix.ing · top · new · best · stats · spec

Pseudoprimes stronger than strong pseudoprimes

2012/02/15 by John H. Castillo, Castillo, John H., Gilberto García-Pulgarín +3
Computer Science · Mathematics · #11A05 #11A07 #11A15 #11A63 #16U60 #Analytic Number Theory Research #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Number Theory (math.NT) #math.NT #msc:11A05 #msc:11A07 #msc:11A15 #msc:11A63 #msc:16U60

paper · pdf · doi:10.48550/arxiv.1202.3428

7 pages, corrected typos, former version v1 divided in two manuscripts see arXiv:1203.1273v1 [math.NT], added references

openalex publication_date 2012/02/15 · arxiv created 2012/03/07 · arxiv updated 2012/03/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce a new class of pseudoprimes. In this work we characterize Midy pseudoprimes, give some of their properties and established interesting connections with other known pseudoprimes, in particular we show that every divisor of a Midy pseudoprime is either a prime or a Midy pseudoprime and in the last case it is a strong pseudoprime.

Citations

Related