/- 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. -/ module public import FormalConjecturesUtil

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.

References:

    Wikipedia

    OEIS A055010

    OEIS A007505

    OEIS A002235

    [Bo72] Borho, W. (1972). On Thabit ibn Kurrah's formula for amicable numbers, Math. Comp. 26 (118), 571--578.

    [Gu04] Guy, R. K. (2004). Unsolved Problems in Number Theory, 3rd ed., Problem B4, Springer, New York. https://doi.org/10.1007/978-0-387-26677-0

@[expose] public sectionnamespace ThabitNumber

The $n$-th Thabit number of the first kind, $K_n = 3 \cdot 2^n - 1$ (OEIS A055010).

def thabitNumber (n : ℕ) : ℕ := 3 * 2 ^ n - 1

The Thabit numbers $K_n$ are prime for $n = 0, 1, 2, 3, 4$ ($2, 5, 11, 23, 47$) and composite at $n = 5$ ($K_5 = 95 = 5 \cdot 19$).

@[category test, AMS 11] theorem thabitNumber_small_values : (thabitNumber 0).Prime ∧ (thabitNumber 1).Prime ∧ (thabitNumber 2).Prime ∧ (thabitNumber 3).Prime ∧ (thabitNumber 4).Prime ∧ ¬ (thabitNumber 5).Prime := ⊢ Nat.Prime (thabitNumber 0) ∧ Nat.Prime (thabitNumber 1) ∧ Nat.Prime (thabitNumber 2) ∧ Nat.Prime (thabitNumber 3) ∧ Nat.Prime (thabitNumber 4) ∧ ¬Nat.Prime (thabitNumber 5) All goals completed! 🐙

At $n = 2$, $p = K_1 = 5$, $q = K_2 = 11$, and $r = 71$ produce the classic amicable pair $(220, 284)$.

⊢ (ArithmeticFunction.sigma 1) 220 = 220 + 284 ∧ (ArithmeticFunction.sigma 1) 284 = 220 + 284 ∧ 220 ≠ 284 All goals completed! 🐙

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$.

@[category textbook, AMS 11] theorem thabit_amicable_rule {n : ℕ} (hn : 2 ≤ n) (hp : (thabitNumber (n - 1)).Prime) (hq : (thabitNumber n).Prime) (hr : (9 * 2 ^ (2 * n - 1) - 1).Prime) : IsAmicable (2 ^ n * thabitNumber (n - 1) * thabitNumber n) (2 ^ n * (9 * 2 ^ (2 * n - 1) - 1)) := n:ℕhn:2 ≤ nhp:Nat.Prime (thabitNumber (n - 1))hq:Nat.Prime (thabitNumber n)hr:Nat.Prime (9 * 2 ^ (2 * n - 1) - 1)⊢ IsAmicable (2 ^ n * thabitNumber (n - 1) * thabitNumber n) (2 ^ n * (9 * 2 ^ (2 * n - 1) - 1)) All goals completed! 🐙

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.

Reference: Wikipedia

@[category research open, AMS 11] theorem infinitely_many_thabit_primes : {n : ℕ | (thabitNumber n).Prime}.Infinite := ⊢ {n | Nat.Prime (thabitNumber n)}.Infinite All goals completed! 🐙

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.

@[category research open, question, AMS 11] theorem exists_thabit_amicable_exponent_gt_seven : ∃ n > 7, (thabitNumber (n - 1)).Prime ∧ (thabitNumber n).Prime ∧ (9 * 2 ^ (2 * n - 1) - 1).Prime := ⊢ ∃ n > 7, Nat.Prime (thabitNumber (n - 1)) ∧ Nat.Prime (thabitNumber n) ∧ Nat.Prime (9 * 2 ^ (2 * n - 1) - 1) All goals completed! 🐙end ThabitNumber