Carmichael number: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Karsten Meyer
imported>Olier Raby
Line 2: Line 2:
A '''Carmichael number''' is a composite number named after the mathematician [[Robert Daniel Carmichael]]. A Carmichael number <math>\scriptstyle c\ </math> satisfies for every integer <math>\scriptstyle a\ </math> that <math>\scriptstyle a^c - a\ </math> is divisible by <math>\scriptstyle c\ </math>. A Carmichael number ''c'' also satisfies the congruence <math>\scriptstyle a^{c-1} \equiv 1 \pmod c</math>, if <math>\scriptstyle \operatorname{gcd}(a,c) = 1</math>. The first few Carmichael numbers are 561, 1105, 1729, 2465, 2821, 6601 and 8911. In 1994 Pomerance, Alford and Granville proved that there exist infinitely many Carmichael numbers.
A '''Carmichael number''' is a composite number named after the mathematician [[Robert Daniel Carmichael]]. A Carmichael number <math>\scriptstyle c\ </math> satisfies for every integer <math>\scriptstyle a\ </math> that <math>\scriptstyle a^c - a\ </math> is divisible by <math>\scriptstyle c\ </math>. A Carmichael number ''c'' also satisfies the congruence <math>\scriptstyle a^{c-1} \equiv 1 \pmod c</math>, if <math>\scriptstyle \operatorname{gcd}(a,c) = 1</math>. The first few Carmichael numbers are 561, 1105, 1729, 2465, 2821, 6601 and 8911. In 1994 Pomerance, Alford and Granville proved that there exist infinitely many Carmichael numbers.


== Properties of a Carmichael number ==
== Properties ==


*Every Carmichael number is square-free and has at least three different prime factors
*Every Carmichael number is square-free and has at least three different prime factors

Revision as of 03:57, 4 March 2008

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
Code [?]
 
This editable Main Article is under development and subject to a disclaimer.

A Carmichael number is a composite number named after the mathematician Robert Daniel Carmichael. A Carmichael number satisfies for every integer that is divisible by . A Carmichael number c also satisfies the congruence , if . The first few Carmichael numbers are 561, 1105, 1729, 2465, 2821, 6601 and 8911. In 1994 Pomerance, Alford and Granville proved that there exist infinitely many Carmichael numbers.

Properties

  • Every Carmichael number is square-free and has at least three different prime factors
  • For every Carmichael number c it holds that is divisible by for every one of its prime factors .
  • Every Carmichael number is an Euler pseudoprime.
  • Every absolute Euler pseudoprime is a Carmichael number.

Chernick's Carmichael numbers

J. Chernick found in 1939 a way to construct Carmichael numbers[1]. If, for a natural number n, the three numbers , and are prime numbers, the product is a Carmichael number. Equivalent to this is that if , and are prime numbers, then the product is a Carmichael number.

To construct Carmichael numbers with , you could only use numbers which ends with 0, 1, 5 or 6.

This way to construct Carmichael numbers could expand to with the restiction, that for the variable is divisible bei

References and notes

Further reading

Links