Korselt Rational Bases and Sets
Number Theory
2019-11-22 v1
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.
Keywords
Cite
@article{arxiv.1911.09324,
title = {Korselt Rational Bases and Sets},
author = {Nejib Ghanmi},
journal= {arXiv preprint arXiv:1911.09324},
year = {2019}
}