Samiksha Jaiswal (Editor)

Knödel number

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit

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 i m n 1 ( mod m ) . The concept is named after Walter Knödel.

The set of all n-Knödel numbers is denoted Kn. The special case K1 represents the Carmichael numbers.

Every composite number m is a n-Knödel number for n = m φ ( m ) .

Literature

  • Makowski, A (1963). Generalization of Morrow's D-Numbers. p. 71. 
  • Ribenboim, Paulo (1989). The New Book of Prime Number Records. New York: Springer-Verlag. p. 101. ISBN 978-0-387-94457-9. 
  • Weisstein, Eric W. "Knödel Numbers". MathWorld. 
  • References

    Knödel number Wikipedia