Korselt Rational Bases and Sets
Abstract
For a positive integer N and A a subset of Q, let A-KS(N) denote the set of α=α1α2∈ A \0,N\ verifying α2p-α1 divides α2N-α1 for every prime divisor p of N. The set A-KS(N) is called the set of Korselt bases of N in A or simply the A-Korselt set of N. In this paper, we prove that for each squarefree composite number N∈N\0,1\ the Q-Korselt set of N is finite where we provide an upper and lower bounds for each Korselt base of N in Q. Furthermore, we give a necessary and a sufficient condition for the upper bound of a Korselt base to be reached.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.