PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
Knödel number (Definition)

Given a positive integer $ n$, the composite integers $ m > n$ such that any $ b < m$ coprime to $ m$ satisfies $ b^{m - n} \equiv 1 \mod m$ form the infinite set of Knödel numbers $ K_n$. The Carmichael numbers are $ K_1$. There are infinitely many Knodel number $ K_n$ for a given $ n$, something which was first proven only for $ n > 2$. Erdős speculated that this was also true for $ n = 1$ but two decades passed before this was conclusively proved by Alford, Granville and Pomerance.

Bibliography

1
W. R. Alford, A. Granville, and C. Pomerance. ``There are Infinitely Many Carmichael Numbers'' Annals of Mathematics 139 (1994): 703 - 722
2
P. Ribenboim, The Little Book of Bigger Primes, (2004), New York: Springer-Verlag, p. 102.



"Knödel number" is owned by CompositeFan.
(view preamble)

View style:

Other names:  Knodel number

Attachments:
table of small Knödel numbers $K_n$ for $0 < n < 26$ (Example) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: Carmichael numbers, infinite set, coprime, composite, integer, positive
There is 1 reference to this entry.

This is version 2 of Knödel number, born on 2006-07-27, modified 2007-07-21.
Object id is 8181, canonical name is KnodelNumber.
Accessed 1111 times total.

Classification:
AMS MSC11A51 (Number theory :: Elementary number theory :: Factorization; primality)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)