In this article, many concepts such as Korselt numbers that are related to Carmichael numbers have
been studied. It deserves to mention that the Korselt numbers and sets were discussed for the first time in 2007 by
Echi.
Let N be a positive integer and α a non-zero integer. If N ̸= α and p − α divides N − α for each prime divisor p of
N, then N is called an α-Korselt number (Kα-number). Korselt numbers were determined by studying the converse
of Fermat’s Little Theorem. To validate the concerned theorems, illustrated examples are solved in order to support
the correctness of these theories. In this article we addressed errors in the relevant literature, and we introduced
proper corrections with proofs for them.
Finally, many notes have been taken and directed us to build and develop a number of algorithms in order to find
Korselt sets for relatively large numbers in an effective way which may require a great time and need tedious effort
if it is to be calculated manually.