Lucas-Carmichael number

In mathematics, a Lucas-Carmichael number is a positive integer "n" such that if "p" is a prime factor of "n", then "p" + 1 is a factor of "n" + 1. By convention, a number is only regarded as a Lucas-Carmichael number if it is odd and square-free (not divisible by the square of a prime number), otherwise any cube of a prime number, such as 8 or 27, would be a Lucas-Carmichael number (since n3+1 = (n+1)(n2-n+1) is always divisible by n+1).

Thus the smallest such number is 399 = 3 × 7 × 19; 399+1 = 400; 3+1, 7+1 and 19+1 are all factors of 400. The first few numbers, and their factors, are OEIS|id=A006972:

:399 = 3 × 7 × 19

:935 = 5 × 11 × 17

:2015 = 5 × 13 × 31

:2915 = 5 × 11 × 53

:4991 = 7 × 23 × 31

:5719 = 7 × 19 × 43

:7055 = 5 × 17 × 83

:8855 = 5 × 7 × 11 × 23

:12719 = 7 × 23 × 79

:18095 = 5 × 7 × 11 × 47

:20999 = 11 × 23 × 83

:22847 = 11 × 31 × 67

:29315 = 5 × 11 × 13 × 41

:31535 = 5 × 7 × 17 × 53

:46079 = 11 × 59 × 71

:51359 = 7 × 11 × 23 × 291

:76751 = 23 × 47 × 71

:80189 = 17 × 53 × 89

:81719 = 11 × 17 × 19 × 23

:88559 = 19 × 59 × 79

:104663 = 13 × 83 × 97

The smallest Lucas-Carmichael number with 5 factors is 588455 = 5 × 7 × 17 × 23 × 43.

It is not known whether any Lucas-Carmichael number is also a Carmichael number.

References

* "Unsolved Problems in Number Theory" (3rd edition) by Richard Guy (Springer Verlag, 2004), section A13.
* [http://planetmath.org/encyclopedia/LucasCarmichaelNumber.html PlanetMath]


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Carmichael-Zahl — Eine natürliche Zahl heißt Carmichael Zahl, benannt nach dem Mathematiker Robert Daniel Carmichael, wenn sie eine fermatsche Pseudoprimzahl bezüglich aller zu ihr teilerfremden Basen ist. Carmichael Zahlen spielen eine Rolle bei der Analyse von… …   Deutsch Wikipedia

  • Lucas pseudoprime — In number theory, the classes of Lucas pseudoprime and Fibonacci pseudoprime comprise sequences of composite integers that passes certain tests that all primes pass: in this case, criteria relative to some Lucas sequence.DefinitionGiven two… …   Wikipedia

  • 2000 (number) — 2000 (two thousand) is the natural number following 1999 and preceding 2001.See also: millennium, year 2000 AD, Y2K, 2000 (disambiguation).Two thousand is the highest number expressible using only two unmodified characters in roman numerals… …   Wikipedia

  • 300 (number) — This article is about the numbers 300 to 399. For other uses of 300, see 300 (disambiguation). For the guitar, see Gibson ES 335. For the British tilting train, see British Rail Class 390. For the Dada magazine, see 391 (magazine). For the… …   Wikipedia

  • 900 (number) — For the year 900, see 900 BC or 900 AD. 900 (nine hundred) is the natural number following 899 and preceding 901. It is the square of 30 and the sum of Euler s totient function for the first 54 integers. In base 10 it is a Harshad number. List of …   Wikipedia

  • 4000 (number) — 4000 (four thousand) is the natural number following 3999 and preceding 4001. It is a decagonal number. Selected numbers in the range 4001 4999 * 4005 triangular number * 4007 safe prime * 4010 magic constant of n times; n normal magic square and …   Wikipedia

  • 5000 (number) — 5000 (five thousand) is the natural number following 4999 and preceding 5001. Five thousand is the largest isogrammic number in the English language. Selected numbers in the range 5001 5999 * 5003 Sophie Germain prime * 5020 amicable number with… …   Wikipedia

  • 1000 (number) — List of numbers Integers ← 1k 2k 3k 4k 5k 6k 7k 8k 9k → Cardinal 1000 one thousand …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • 500 (number) — For other uses, see 500 (disambiguation). ← 499 501 → 500 List of numbers Integers …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.