Thabit number


In number theory, a Thabit number, Thâbit ibn Kurrah number, or 321 number is an integer of the form for a non-negative integer n.
The first few Thabit numbers are:
The 9th Century mathematician, physician, astronomer and translator Thābit ibn Qurra is credited as the first to study these numbers and their relation to amicable numbers.

Properties

The binary representation of the Thabit number 3·2n−1 is n+2 digits long, consisting of "10" followed by n 1s.
The first few Thabit numbers that are prime :
, there are 62 known prime Thabit numbers. Their n values are :
The primes for n≥234760 were found by the distributed computing project 321 search. The largest of these, 3·211895718−1, has 3580969 digits and was found in June 2015.
In 2008, Primegrid took over the search for Thabit primes. It is still searching and has already found all currently known Thabit primes with n ≥ 4235414. It is also searching for primes of the form 3·2n+1, such primes are called Thabit primes of the second kind or 321 primes of the second kind.
The first few Thabit numbers of the second kind are:
The first few Thabit primes of the second kind are:
Their n values are:

Connection with amicable numbers

When both n and n−1 yield Thabit primes, and is also prime, a pair of amicable numbers can be calculated as follows:
For example, n = 2 gives the Thabit prime 11, and n−1 = 1 gives the Thabit prime 5, and our third term is 71. Then, 22=4, multiplied by 5 and 11 results in 220, whose divisors add up to 284, and 4 times 71 is 284, whose divisors add up to 220.
The only known n satisfying these conditions are 2, 4 and 7, corresponding to the Thabit primes 11, 47 and 383 given by n, the Thabit primes 5, 23 and 191 given by n−1, and our third terms are 71, 1151 and 73727., and )

Generalization

For integer b ≥ 2, a Thabit number base b is a number of the form ·bn − 1 for a non-negative integer n. Also, for integer b ≥ 2, a Thabit number of the second kind base b is a number of the form ·bn + 1 for a non-negative integer n.
The Williams numbers are also a generalization of Thabit numbers. For integer b ≥ 2, a Williams number base b is a number of the form ·bn − 1 for a non-negative integer n. Also, for integer b ≥ 2, a Williams number of the second kind base b is a number of the form ·bn + 1 for a non-negative integer n.
For integer b ≥ 2, a Thabit prime base b is a Thabit number base b that is also prime. Similarly, for integer b ≥ 2, a Williams prime base b is a Williams number base b that is also prime.
Every prime p is a Thabit prime of the first kind base p, a Williams prime of the first kind base p+2, and a Williams prime of the second kind base p; if p ≥ 5, then p is also a Thabit prime of the second kind base p−2.
It is a conjecture that for every integer b ≥ 2, there are infinitely many Thabit primes of the first kind base b, infinitely many Williams primes of the first kind base b, and infinitely many Williams primes of the second kind base b; also, for every integer b ≥ 2 that is not congruent to 1 modulo 3, there are infinitely many Thabit primes of the second kind base b.
The exponent of Thabit primes of the second kind cannot congruent to 1 mod 3, the exponent of Williams primes of the first kind cannot congruent to 4 mod 6, and the exponent of Williams primes of the second kind cannot congruent to 1 mod 6, since the corresponding polynomial to b is a reducible polynomial. ·bn + 1 is divisible by b2 + b + 1; if n ≡ 4 mod 6, then ·bn − 1 is divisible by b2 − b + 1; and if n ≡ 1 mod 6, then Otherwise, the corresponding polynomial to b is an irreducible polynomial, so if Bunyakovsky conjecture is true, then there are infinitely many bases b such that the corresponding number is prime. ·bn − 1 is irreducible for all nonnegative integer n, so if Bunyakovsky conjecture is true, then there are infinitely many bases b such that the corresponding number
bnumbers n such that ·bn − 1 is prime
numbers n such that ·bn + 1 is prime
numbers n such that ·bn − 1 is prime
numbers n such that ·bn + 1 is prime
20, 1, 2, 4, 8, 16,...
3
41, 2, 4, 5, 6, 7, 9, 16, 24, 27, 36, 74, 92, 124, 135, 137, 210,...1, 3, 4, 6, 9, 15, 18, 33, 138, 204, 219, 267,...
5
61, 2, 3, 13, 21, 28, 30, 32, 36, 48, 52, 76,...1, 6, 17, 38, 50, 80, 207, 236, 264,...
70, 4, 7, 10, 14, 23, 59,...
81, 5, 7, 21, 33, 53, 103,...1, 2, 11, 14, 21, 27, 54, 122, 221,...
91, 2, 4, 5, 7, 10, 11, 13, 15, 19, 27, 29, 35, 42, 51, 70, 112, 164, 179, 180, 242,...0, 2, 6, 9, 11, 51, 56, 81,...
10
110, 1, 2, 3, 4, 11, 13, 22, 27, 48, 51, 103, 147, 280,...0, 2, 3, 6, 8, 138, 149, 222,...
122, 6, 11, 66, 196,...1, 2, 8, 9, 17, 26, 62, 86, 152,...

Least k ≥ 1 such that ·nk − 1 is prime are:
Least k ≥ 1 such that ·nk + 1 is prime are:
Least k ≥ 1 such that ·nk − 1 is prime are:
Least k ≥ 1 such that ·nk + 1 is prime are: