词条 | 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}}. Carol numbers were first studied by Cletus Emmanuel, who named them after a friend, Carol G. Kirnon.[1][2] Binary representationFor 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 2n-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)th power of two. Primes and modular restrictionsStarting 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 3x + 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}}). The 7th Carol number and 5th Carol prime, 16127, is also a prime when its digits are reversed, so it is the smallest Carol emirp.[3] The 12th Carol number and 7th Carol prime, 16769023, is also a Carol emirp.[4] {{As of|2018|2}}, the largest known prime Carol number has index n = 695631, which has 418812 digits.[5][6] It was found by Mark Rodenkirch in July 2016 using the programs CKSieve and PrimeFormGW. It is the 44th Carol prime.GeneralizationsA generalized Carol number base b is defined to be a number of the form (bn−1)2 − 2 with n ≥ 1, a generalized Carol number base b can be prime only if b is even, since if b is odd, then all generalized Carol numbers base b are even and thus not prime. A generalized Carol number to base bn is also a generalized Carol number to base b. Least n ≥ 1 such that ((2b)n−1)2 − 2 is prime are 2, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 2, 159, 1, 1, 2, 1, 1, 1, 4, 3, 1, 12, 1, 1, 2, 9, 1, 88, 2, 1, 1, 12, 4, 1, 1, 183, 1, 1, 320, 24, 4, 3, 2, 1, 3, 1, 5, 2, 4, 2, 1, 2, 1, 705, 2, 3, 29, 1, 1, 1, 4836, 20, 1, 135, 1, 4, 1, 6, 1, 15, 3912, 1, 2, 8, 3, 24, 1, 14, 4, 1, 2, 321, 11, 1, 174, 1, 6, 1, 42, 310, 1, 2, 27, 2, 1, 29, 3, 103, 20, ...
References1. ^Cletus Emmanuel at Prime Pages 2. ^[https://groups.yahoo.com/neo/groups/primenumbers/conversations/messages/14584 Message to Yahoo primenumbers group] from Cletus Emmanuel 3. ^Prime Curios 16127 at Prime Pages 4. ^Prime Curios 16769023 at Prime Pages 5. ^Entry for 695631st Carol number at Prime Pages 6. ^Carol and Kynea Prime Search by Mark Rodenkirch External links
1 : Integer sequences |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。