The Knödel numbers for a given positiveinteger are the set of composite integers such that any coprime to satisfies
. The Carmichael numbers are . There are infinitely many Knodel number for a given , something which was first proven only for . Erdős speculated that this was also true for but two decades passed before this was
conclusively proved by Alford, Granville and Pomerance.
This is version 3 of Knödel number, born on 2006-07-27, modified 2008-11-29.
Object id is 8181, canonical name is KnodelNumber.
Accessed 1237 times total.