- Carol number
A Carol number is an integer of the form . An equivalent formula is . The first few Carol numbers are: −1, 7, 47, 223, 959, 3967, 16127, 65023, 261119, 1046527 OEIS|id=A093112.
For "n" > 2, the binary representation of the "n"th Carol number is "n" − 2 consecutive ones, a single zero in the middle, and "n" + 1 more consecutive ones, or to put it algebraically,
:
So, for example, 47 is 101111 in binary, 223 is 11011111, etc. The difference between the "n"th Mersenne number and the "n"th Carol number is . This gives yet another equivalent expression for Carol numbers, . The difference between the "n"th
Kynea number and the "n"th Carol number is the ("n" + 2)thpower of two .Starting with 7, every third Carol number is a multiple of 7. Thus, for a Carol number to also be a
prime number , its index "n" cannot be of the form 3"x" + 2 for "x" > 0. The first few Carol numbers that are also prime are 7, 47, 223, 3967, 16127 (these are listed in Sloane's OEIS2C|id=A091516).As of July 2007 , the largest known Carol number that is also a prime is the Carol number for "n" = 253987. [http://www.geocities.com/harvey563/Carol_Kynea.txt] It was found by Cletus Emmanuel in May 2007, using the programs MultiSieve and PrimeFormGW. It is the 40th Carol prime.Carol numbers and the formula to discover them were first found and studied by Cletus Emmanuel who named them after a friend, Carol G. Kirnon [http://primes.utm.edu/bios/code.php?code=p89] [http://tech.groups.yahoo.com/group/primenumbers/message/14584]
External links
*
* [http://primes.utm.edu/primes/page.php?id=73109 Prime Database entry for Carol(226749)]
* [http://primes.utm.edu/primes/page.php?id=77385 Prime Database entry for Carol(248949)]
* [http://www.geocities.com/harvey563/ Generalized Woodall Primes (and related forms)]
* [http://primes.utm.edu/bios/page.php?id=374 Cletus Emmanuel]
Wikimedia Foundation. 2010.