Home On Congruence Conditions for Primality
Article
Licensed
Unlicensed Requires Authentication

On Congruence Conditions for Primality

  • Sherry Gong and Scott Duke Kominers
Published/Copyright: July 8, 2010
Become an author with De Gruyter Brill
Integers
From the journal Volume 10 Issue 3

Abstract

For any k ≥ 0, all prime n satisfy the congruence k(n) ≡ 2 mod φ(n). We show that this congruence in fact characterizes the primes, in the sense that it is satisfied by only finitely many composite n. This characterization generalizes the results of Lescot and Subbarao for the cases k = 0 and k = 1. For 0 ≤ k ≤ 14, we enumerate the composite n satisfying the congruence. We also prove that any composite n which satisfies the congruence for some k satisfies it for infinitely many k.

Received: 2009-05-22
Revised: 2010-02-28
Accepted: 2010-03-07
Published Online: 2010-07-08
Published in Print: 2010-July

© de Gruyter 2010

Downloaded on 28.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/integ.2010.026/html
Scroll to top button