Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03647077n
Noun Concept
Categories: Pseudoprimes, Articles with short description, Modular arithmetic, Integer sequences
EN
Carmichael number  Absolute pseudoprime  Absolute Fermat pseudoprime  Absolute Pseudoprime Number  Absolute Pseudoprime Numbers
EN
In number theory, a Carmichael number is a composite number n {\displaystyle n}, which in modular arithmetic satisfies the congruence relation: b n ≡ b {\displaystyle b^{n}\equiv b{\pmod {n}}} for all integers b {\displaystyle b}. Wikipedia
Definitions
Relations
Sources
EN
In number theory, a Carmichael number is a composite number n {\displaystyle n}, which in modular arithmetic satisfies the congruence relation: b n ≡ b {\displaystyle b^{n}\equiv b{\pmod {n}}} for all integers b {\displaystyle b}. Wikipedia
A special kind of number in number theory named for mathematician Robert Carmichael Wikipedia Disambiguation
A composite number in number theory Wikidata
A composite number n that satisfies the modular arithmetic congruence relation b n − 1 ≡ 1 ( mod n ) for all integers 1 < b < n that are relatively prime to n . Wiktionary
IS A
series
natural number
HAS INSTANCE
1105
NAMED AFTER
Robert Daniel Carmichael
Wikipedia
EN
Carmichael number
Wikidata
EN
Carmichael number
Wiktionary
EN
Carmichael number
Wikipedia Redirections
EN
Absolute Fermat pseudoprime, Absolute Pseudoprime, Absolute pseudoprime, Absolute Pseudoprime Number, Absolute Pseudoprime Numbers, Carmichael Number, Carmichael numbers, Korselt's criterion

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License