The Korselt set of a power of a prime.

A Carmichael number is a composite number such that divides for all integers coprime to . Korselt discovered that is a Carmichael number if and only if is square-free and for each prime divisor of . Let , a -number is defined to be a composite number , such that and for each prime . The set of all such that is a -number is called the Korselt set of and we denote this set by . In this paper, we investigate some properties of when is a power of a prime. [ABSTRACT FROM AUTHOR]