/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
Thabit numbers and Thabit primes
For $n \ge 0$, the $n$-th Thabit number (of the first kind) is $K_n = 3 \cdot 2^n - 1$. In the
ninth century, Thābit ibn Qurra proved that whenever $n \ge 2$ makes $p = K_{n-1}$, $q = K_n$, and
$r = 9 \cdot 2^{2n - 1} - 1$ simultaneously prime, the integers $2^n p q$ and $2^n r$ form an
amicable pair (IsAmicable). Whether infinitely many Thabit primes exist, and whether Thābit ibn
Qurra's rule produces any amicable pair beyond the three known exponents $n = 2, 4, 7$ [Bo72, Gu04],
remain open.
Thābit ibn Qurra's amicable number theorem [Bo72]: for $n \ge 2$, if $K_{n-1}$, $K_n$, and
$9 \cdot 2^{2n - 1} - 1$ are all prime, then $2^n K_{n-1} K_n$ and $2^n (9 \cdot 2^{2n - 1} - 1)$
form an amicable pair.
The hypothesis $n \ge 2$ excludes $n = 1$, where $K_0 = 2$ is not coprime to $2^n$.
There are infinitely many exponents $n \in \mathbb{N}$ (OEIS A002235)
for which the Thabit number $K_n = 3 \cdot 2^n - 1$ is prime
(OEIS A007505); since thabitNumber is injective, this is equivalent to
the infinitude of Thabit primes themselves.
Does there exist an integer $n > 7$ for which $K_{n-1}$, $K_n$, and $9 \cdot 2^{2n - 1} - 1$ are
simultaneously prime, yielding an amicable pair via Thābit ibn Qurra's rule [Bo72, Gu04]? Only
$n = 2, 4, 7$ are currently known.