A Knödel number[1] for a given positive integer n is a composite number m with the property that each i < m coprime to m satisfies \[ i^{m  n} \equiv 1 \pmod{m} \]. The set of all such integers for n is then called the set of Knödel numbers K_{n}. The special case K_{1} are the Carmichael numbers. Examples
Literature Makowski, A (1963). Generalization of Morrow's DNumbers. p. 71.
^ Named after Walter Knödel, born May 20th, 1926 in Vienna. Knödel earned a Ph.D. in number theory in 1948 (advisors: Hlawka and Radon) and obtained the habilitation in 1953. Since 1961 he is professor at University of Stuttgart, establishing the new department of computer science, see also [1]. Retrieved from "http://en.wikipedia.org/"

