paper

Korselt Rational Bases and Sets

arXiv:1911.09324

Abstract

For a positive integer and a subset of , let - denote the set of verifying divides for every prime divisor of . The set - is called the set of Korselt bases of in or simply the -Korselt set of . In this paper, we prove that for each squarefree composite number the -Korselt set of is finite where we provide an upper and lower bounds for each Korselt base of in . Furthermore, we give a necessary and a sufficient condition for the upper bound of a Korselt base to be reached.

Korselt Rational Bases and Sets · wovepaper