In number theory, an n-Knödel number for a given positive integer n is a composite number m with the property that each i < m coprime to m satisfies .[1] The concept is named after Walter Knödel.[citation needed]
The set of all n-Knödel numbers is denoted Kn.[1]The special case K1 is the Carmichael numbers.[1] There are infinitely many n-Knödel numbers for a given n.
Due to Euler's theorem every composite number m is an n-Knödel number for where is Euler's totient function.