/-
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 FormalConjecturesUtilTwin primes of the form $(3^n - k) 2^n \pm 1$
For $n > 0$, $a(n)$ is the smallest nonnegative integer $k$ such that $(3^n - k) 2^n - 1$ and $(3^n - k) 2^n + 1$ form a twin prime pair.
References:
@[expose] public sectionnamespace OeisA214497
Smallest $k \ge 0$ such that $(3^n - k) 2^n - 1$ and $(3^n - k) 2^n + 1$
are both prime, or none if no such $k$ exists.
def a (n : ℕ) : Option ℕ :=
(List.range (3 ^ n)).find? fun k =>
Nat.Prime ((3 ^ n - k) * 2 ^ n - 1) && Nat.Prime ((3 ^ n - k) * 2 ^ n + 1)@[category test, AMS 11]
theorem a_1 : a 1 = some 0 := ⊢ a 1 = some 0 All goals completed! 🐙@[category test, AMS 11]
theorem a_2 : a 2 = some 6 := ⊢ a 2 = some 6 All goals completed! 🐙⊢ (decide (Nat.Prime ((3 ^ 3 - 3) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 3) * 2 ^ 3 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 3)).length),
(List.range (3 ^ 3))[i] = 3 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 3 - (List.range (3 ^ 3))[j]) * 2 ^ 3 - 1)) &&
decide (Nat.Prime ((3 ^ 3 - (List.range (3 ^ 3))[j]) * 2 ^ 3 + 1)))) =
true
refine ⟨?_, 3, by ⊢ 3 < (List.range (3 ^ 3)).length simp All goals completed! 🐙, rfl, fun j hj => ?_⟩
· refine_1 ⊢ (decide (Nat.Prime ((3 ^ 3 - 3) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 3) * 2 ^ 3 + 1))) = true simp only [Bool.and_eq_true, decide_eq_true_eq] refine_1 ⊢ Nat.Prime ((3 ^ 3 - 3) * 2 ^ 3 - 1) ∧ Nat.Prime ((3 ^ 3 - 3) * 2 ^ 3 + 1)
norm_num All goals completed! 🐙
· refine_2 j:ℕhj:j < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - (List.range (3 ^ 3))[j]) * 2 ^ 3 - 1)) &&
decide (Nat.Prime ((3 ^ 3 - (List.range (3 ^ 3))[j]) * 2 ^ 3 + 1)))) =
true simp only [List.getElem_range] refine_2 j:ℕhj:j < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - j) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - j) * 2 ^ 3 + 1)))) = true
interval_cases j refine_2.«0» j:ℕhj:0 < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - 0) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 0) * 2 ^ 3 + 1)))) = truerefine_2.«1» j:ℕhj:1 < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - 1) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 1) * 2 ^ 3 + 1)))) = truerefine_2.«2» j:ℕhj:2 < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - 2) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 2) * 2 ^ 3 + 1)))) = true <;> refine_2.«0» j:ℕhj:0 < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - 0) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 0) * 2 ^ 3 + 1)))) = truerefine_2.«1» j:ℕhj:1 < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - 1) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 1) * 2 ^ 3 + 1)))) = truerefine_2.«2» j:ℕhj:2 < 3⊢ (!(decide (Nat.Prime ((3 ^ 3 - 2) * 2 ^ 3 - 1)) && decide (Nat.Prime ((3 ^ 3 - 2) * 2 ^ 3 + 1)))) = true norm_num All goals completed! 🐙
@[category test, AMS 11]
theorem a_4 : a 4 = some 9 := by ⊢ a 4 = some 9
rw [a, ⊢ List.find? (fun k ↦ decide (Nat.Prime ((3 ^ 4 - k) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - k) * 2 ^ 4 + 1)))
(List.range (3 ^ 4)) =
some 9 ⊢ (decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 4)).length),
(List.range (3 ^ 4))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 - 1)) &&
decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 + 1)))) =
true List.find?_eq_some_iff_getElem ⊢ (decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 4)).length),
(List.range (3 ^ 4))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 - 1)) &&
decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 + 1)))) =
true ⊢ (decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 4)).length),
(List.range (3 ^ 4))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 - 1)) &&
decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 + 1)))) =
true] ⊢ (decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 4)).length),
(List.range (3 ^ 4))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 - 1)) &&
decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 + 1)))) =
true
refine ⟨?_, 9, by ⊢ 9 < (List.range (3 ^ 4)).length simp All goals completed! 🐙, rfl, fun j hj => ?_⟩
· refine_1 ⊢ (decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 + 1))) = true simp only [Bool.and_eq_true, decide_eq_true_eq] refine_1 ⊢ Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 - 1) ∧ Nat.Prime ((3 ^ 4 - 9) * 2 ^ 4 + 1)
norm_num All goals completed! 🐙
· refine_2 j:ℕhj:j < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 - 1)) &&
decide (Nat.Prime ((3 ^ 4 - (List.range (3 ^ 4))[j]) * 2 ^ 4 + 1)))) =
true simp only [List.getElem_range] refine_2 j:ℕhj:j < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - j) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - j) * 2 ^ 4 + 1)))) = true
interval_cases j refine_2.«0» j:ℕhj:0 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 0) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 0) * 2 ^ 4 + 1)))) = truerefine_2.«1» j:ℕhj:1 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 1) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 1) * 2 ^ 4 + 1)))) = truerefine_2.«2» j:ℕhj:2 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 2) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 2) * 2 ^ 4 + 1)))) = truerefine_2.«3» j:ℕhj:3 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 3) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 3) * 2 ^ 4 + 1)))) = truerefine_2.«4» j:ℕhj:4 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 4) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 4) * 2 ^ 4 + 1)))) = truerefine_2.«5» j:ℕhj:5 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 5) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 5) * 2 ^ 4 + 1)))) = truerefine_2.«6» j:ℕhj:6 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 6) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 6) * 2 ^ 4 + 1)))) = truerefine_2.«7» j:ℕhj:7 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 7) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 7) * 2 ^ 4 + 1)))) = truerefine_2.«8» j:ℕhj:8 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 8) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 8) * 2 ^ 4 + 1)))) = true <;> refine_2.«0» j:ℕhj:0 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 0) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 0) * 2 ^ 4 + 1)))) = truerefine_2.«1» j:ℕhj:1 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 1) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 1) * 2 ^ 4 + 1)))) = truerefine_2.«2» j:ℕhj:2 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 2) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 2) * 2 ^ 4 + 1)))) = truerefine_2.«3» j:ℕhj:3 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 3) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 3) * 2 ^ 4 + 1)))) = truerefine_2.«4» j:ℕhj:4 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 4) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 4) * 2 ^ 4 + 1)))) = truerefine_2.«5» j:ℕhj:5 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 5) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 5) * 2 ^ 4 + 1)))) = truerefine_2.«6» j:ℕhj:6 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 6) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 6) * 2 ^ 4 + 1)))) = truerefine_2.«7» j:ℕhj:7 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 7) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 7) * 2 ^ 4 + 1)))) = truerefine_2.«8» j:ℕhj:8 < 9⊢ (!(decide (Nat.Prime ((3 ^ 4 - 8) * 2 ^ 4 - 1)) && decide (Nat.Prime ((3 ^ 4 - 8) * 2 ^ 4 + 1)))) = true norm_num All goals completed! 🐙
@[category test, AMS 11]
theorem a_5 : a 5 = some 9 := by ⊢ a 5 = some 9
rw [a, ⊢ List.find? (fun k ↦ decide (Nat.Prime ((3 ^ 5 - k) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - k) * 2 ^ 5 + 1)))
(List.range (3 ^ 5)) =
some 9 ⊢ (decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 5)).length),
(List.range (3 ^ 5))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 - 1)) &&
decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 + 1)))) =
true List.find?_eq_some_iff_getElem ⊢ (decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 5)).length),
(List.range (3 ^ 5))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 - 1)) &&
decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 + 1)))) =
true ⊢ (decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 5)).length),
(List.range (3 ^ 5))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 - 1)) &&
decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 + 1)))) =
true] ⊢ (decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 + 1))) = true ∧
∃ i,
∃ (h : i < (List.range (3 ^ 5)).length),
(List.range (3 ^ 5))[i] = 9 ∧
∀ (j : ℕ) (hj : j < i),
(!(decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 - 1)) &&
decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 + 1)))) =
true
refine ⟨?_, 9, by ⊢ 9 < (List.range (3 ^ 5)).length simp All goals completed! 🐙, rfl, fun j hj => ?_⟩
· refine_1 ⊢ (decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 + 1))) = true simp only [Bool.and_eq_true, decide_eq_true_eq] refine_1 ⊢ Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 - 1) ∧ Nat.Prime ((3 ^ 5 - 9) * 2 ^ 5 + 1)
norm_num All goals completed! 🐙
· refine_2 j:ℕhj:j < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 - 1)) &&
decide (Nat.Prime ((3 ^ 5 - (List.range (3 ^ 5))[j]) * 2 ^ 5 + 1)))) =
true simp only [List.getElem_range] refine_2 j:ℕhj:j < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - j) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - j) * 2 ^ 5 + 1)))) = true
interval_cases j refine_2.«0» j:ℕhj:0 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 0) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 0) * 2 ^ 5 + 1)))) = truerefine_2.«1» j:ℕhj:1 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 1) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 1) * 2 ^ 5 + 1)))) = truerefine_2.«2» j:ℕhj:2 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 2) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 2) * 2 ^ 5 + 1)))) = truerefine_2.«3» j:ℕhj:3 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 3) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 3) * 2 ^ 5 + 1)))) = truerefine_2.«4» j:ℕhj:4 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 4) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 4) * 2 ^ 5 + 1)))) = truerefine_2.«5» j:ℕhj:5 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 5) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 5) * 2 ^ 5 + 1)))) = truerefine_2.«6» j:ℕhj:6 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 6) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 6) * 2 ^ 5 + 1)))) = truerefine_2.«7» j:ℕhj:7 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 7) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 7) * 2 ^ 5 + 1)))) = truerefine_2.«8» j:ℕhj:8 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 8) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 8) * 2 ^ 5 + 1)))) = true <;> refine_2.«0» j:ℕhj:0 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 0) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 0) * 2 ^ 5 + 1)))) = truerefine_2.«1» j:ℕhj:1 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 1) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 1) * 2 ^ 5 + 1)))) = truerefine_2.«2» j:ℕhj:2 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 2) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 2) * 2 ^ 5 + 1)))) = truerefine_2.«3» j:ℕhj:3 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 3) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 3) * 2 ^ 5 + 1)))) = truerefine_2.«4» j:ℕhj:4 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 4) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 4) * 2 ^ 5 + 1)))) = truerefine_2.«5» j:ℕhj:5 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 5) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 5) * 2 ^ 5 + 1)))) = truerefine_2.«6» j:ℕhj:6 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 6) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 6) * 2 ^ 5 + 1)))) = truerefine_2.«7» j:ℕhj:7 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 7) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 7) * 2 ^ 5 + 1)))) = truerefine_2.«8» j:ℕhj:8 < 9⊢ (!(decide (Nat.Prime ((3 ^ 5 - 8) * 2 ^ 5 - 1)) && decide (Nat.Prime ((3 ^ 5 - 8) * 2 ^ 5 + 1)))) = true norm_num All goals completed! 🐙Conjecture: There is always one such $k$ for each $n > 0$ such that $(3^n - k) 2^n - 1$ and $(3^n - k) 2^n + 1$ are a twin prime pair.
@[category research open, AMS 11]
theorem conjecture (n : ℕ) (hn : 0 < n) : (a n).isSome := by n:ℕhn:0 < n⊢ (a n).isSome = true
sorry All goals completed! 🐙end OeisA214497