/-
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 FormalConjecturesUtilLeast $m$ such that $m + n$ divides $\mathrm{prime}(m) + \mathrm{prime}(n)$
The sequence $a(n)$ is the least positive integer $m$ such that $m + n$ divides $\mathrm{prime}(m) + \mathrm{prime}(n)$, where $\mathrm{prime}(k)$ denotes the $k$-th prime number (with $\mathrm{prime}(1) = 2$).
References:
@[expose] public sectionnamespace OeisA247824open Nat SetLeast positive integer $m$ such that $m + n$ divides $\mathrm{prime}(m) + \mathrm{prime}(n)$. If no such $m$ exists (or if $n = 0$), returns $0$.
noncomputable def a (n : ℕ) : ℕ :=
if n = 0 then 0 else
sInf { m : ℕ | 0 < m ∧ (m + n) ∣ (Nat.nth Nat.Prime (m - 1) + Nat.nth Nat.Prime (n - 1)) }h:nth Nat.Prime 0 + nth Nat.Prime 0 = 2 * nth Nat.Prime 0⊢ 1 + 1 ∣ 2 * nth Nat.Prime 0
exact dvd_mul_right 2 _ All goals completed! 🐙@[category test, AMS 11]
theorem a_2 : a 2 = 5 := by ⊢ a 2 = 5
dsimp [a] ⊢ sInf {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1} = 5
apply IsLeast.csInf_eq ⊢ IsLeast {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1} 5
refine ⟨⟨by ⊢ 0 < 5 omega All goals completed! 🐙, ?_⟩, fun m hm => ?_⟩
· refine_1 ⊢ 5 + 2 ∣ nth Nat.Prime (5 - 1) + nth Nat.Prime 1 norm_num [Nat.nth_prime_four_eq_eleven, Nat.nth_prime_one_eq_three] All goals completed! 🐙
· refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}⊢ 5 ≤ m by_contra! hlt refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:m < 5⊢ False
have hm1 := hm.1 refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:m < 5hm1:0 < m⊢ False
interval_cases m refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:1 < 5hm1:0 < 1⊢ Falserefine_2.«2» m:ℕhm:2 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:2 < 5hm1:0 < 2⊢ Falserefine_2.«3» m:ℕhm:3 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:3 < 5hm1:0 < 3⊢ Falserefine_2.«4» m:ℕhm:4 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:4 < 5hm1:0 < 4⊢ False
· refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:1 < 5hm1:0 < 1⊢ False revert hm refine_2.«1» m:ℕhlt:1 < 5hm1:0 < 1⊢ 1 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1} → False; norm_num [Nat.nth_prime_zero_eq_two, Nat.nth_prime_one_eq_three] All goals completed! 🐙
· refine_2.«2» m:ℕhm:2 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:2 < 5hm1:0 < 2⊢ False revert hm refine_2.«2» m:ℕhlt:2 < 5hm1:0 < 2⊢ 2 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1} → False; norm_num [Nat.nth_prime_one_eq_three] All goals completed! 🐙
· refine_2.«3» m:ℕhm:3 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:3 < 5hm1:0 < 3⊢ False revert hm refine_2.«3» m:ℕhlt:3 < 5hm1:0 < 3⊢ 3 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1} → False; norm_num [Nat.nth_prime_two_eq_five, Nat.nth_prime_one_eq_three] All goals completed! 🐙
· refine_2.«4» m:ℕhm:4 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1}hlt:4 < 5hm1:0 < 4⊢ False revert hm refine_2.«4» m:ℕhlt:4 < 5hm1:0 < 4⊢ 4 ∈ {m | 0 < m ∧ m + 2 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 1} → False; norm_num [Nat.nth_prime_three_eq_seven, Nat.nth_prime_one_eq_three] All goals completed! 🐙@[category test, AMS 11]
theorem a_3 : a 3 = 5 := by ⊢ a 3 = 5
dsimp [a] ⊢ sInf {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2} = 5
apply IsLeast.csInf_eq ⊢ IsLeast {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2} 5
refine ⟨⟨by ⊢ 0 < 5 omega All goals completed! 🐙, ?_⟩, fun m hm => ?_⟩
· refine_1 ⊢ 5 + 3 ∣ nth Nat.Prime (5 - 1) + nth Nat.Prime 2 norm_num [Nat.nth_prime_four_eq_eleven, Nat.nth_prime_two_eq_five] All goals completed! 🐙
· refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}⊢ 5 ≤ m by_contra! hlt refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:m < 5⊢ False
have hm1 := hm.1 refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:m < 5hm1:0 < m⊢ False
interval_cases m refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:1 < 5hm1:0 < 1⊢ Falserefine_2.«2» m:ℕhm:2 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:2 < 5hm1:0 < 2⊢ Falserefine_2.«3» m:ℕhm:3 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:3 < 5hm1:0 < 3⊢ Falserefine_2.«4» m:ℕhm:4 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:4 < 5hm1:0 < 4⊢ False
· refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:1 < 5hm1:0 < 1⊢ False revert hm refine_2.«1» m:ℕhlt:1 < 5hm1:0 < 1⊢ 1 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2} → False; norm_num [Nat.nth_prime_zero_eq_two, Nat.nth_prime_two_eq_five] All goals completed! 🐙
· refine_2.«2» m:ℕhm:2 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:2 < 5hm1:0 < 2⊢ False revert hm refine_2.«2» m:ℕhlt:2 < 5hm1:0 < 2⊢ 2 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2} → False; norm_num [Nat.nth_prime_one_eq_three, Nat.nth_prime_two_eq_five] All goals completed! 🐙
· refine_2.«3» m:ℕhm:3 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:3 < 5hm1:0 < 3⊢ False revert hm refine_2.«3» m:ℕhlt:3 < 5hm1:0 < 3⊢ 3 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2} → False; norm_num [Nat.nth_prime_two_eq_five] All goals completed! 🐙
· refine_2.«4» m:ℕhm:4 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2}hlt:4 < 5hm1:0 < 4⊢ False revert hm refine_2.«4» m:ℕhlt:4 < 5hm1:0 < 4⊢ 4 ∈ {m | 0 < m ∧ m + 3 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 2} → False; norm_num [Nat.nth_prime_three_eq_seven, Nat.nth_prime_two_eq_five] All goals completed! 🐙@[category test, AMS 11]
theorem a_4 : a 4 = 5 := by ⊢ a 4 = 5
dsimp [a] ⊢ sInf {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3} = 5
apply IsLeast.csInf_eq ⊢ IsLeast {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3} 5
refine ⟨⟨by ⊢ 0 < 5 omega All goals completed! 🐙, ?_⟩, fun m hm => ?_⟩
· refine_1 ⊢ 5 + 4 ∣ nth Nat.Prime (5 - 1) + nth Nat.Prime 3 norm_num [Nat.nth_prime_four_eq_eleven, Nat.nth_prime_three_eq_seven] All goals completed! 🐙
· refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}⊢ 5 ≤ m by_contra! hlt refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:m < 5⊢ False
have hm1 := hm.1 refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:m < 5hm1:0 < m⊢ False
interval_cases m refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:1 < 5hm1:0 < 1⊢ Falserefine_2.«2» m:ℕhm:2 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:2 < 5hm1:0 < 2⊢ Falserefine_2.«3» m:ℕhm:3 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:3 < 5hm1:0 < 3⊢ Falserefine_2.«4» m:ℕhm:4 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:4 < 5hm1:0 < 4⊢ False
· refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:1 < 5hm1:0 < 1⊢ False revert hm refine_2.«1» m:ℕhlt:1 < 5hm1:0 < 1⊢ 1 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3} → False; norm_num [Nat.nth_prime_zero_eq_two, Nat.nth_prime_three_eq_seven] All goals completed! 🐙
· refine_2.«2» m:ℕhm:2 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:2 < 5hm1:0 < 2⊢ False revert hm refine_2.«2» m:ℕhlt:2 < 5hm1:0 < 2⊢ 2 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3} → False; norm_num [Nat.nth_prime_one_eq_three, Nat.nth_prime_three_eq_seven] All goals completed! 🐙
· refine_2.«3» m:ℕhm:3 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:3 < 5hm1:0 < 3⊢ False revert hm refine_2.«3» m:ℕhlt:3 < 5hm1:0 < 3⊢ 3 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3} → False; norm_num [Nat.nth_prime_two_eq_five, Nat.nth_prime_three_eq_seven] All goals completed! 🐙
· refine_2.«4» m:ℕhm:4 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3}hlt:4 < 5hm1:0 < 4⊢ False revert hm refine_2.«4» m:ℕhlt:4 < 5hm1:0 < 4⊢ 4 ∈ {m | 0 < m ∧ m + 4 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 3} → False; norm_num [Nat.nth_prime_three_eq_seven] All goals completed! 🐙@[category test, AMS 11]
theorem a_5 : a 5 = 2 := by ⊢ a 5 = 2
dsimp [a] ⊢ sInf {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4} = 2
apply IsLeast.csInf_eq ⊢ IsLeast {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4} 2
refine ⟨⟨by ⊢ 0 < 2 omega All goals completed! 🐙, ?_⟩, fun m hm => ?_⟩
· refine_1 ⊢ 2 + 5 ∣ nth Nat.Prime (2 - 1) + nth Nat.Prime 4 norm_num [Nat.nth_prime_one_eq_three, Nat.nth_prime_four_eq_eleven] All goals completed! 🐙
· refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4}⊢ 2 ≤ m by_contra! hlt refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4}hlt:m < 2⊢ False
have hm1 := hm.1 refine_2 m:ℕhm:m ∈ {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4}hlt:m < 2hm1:0 < m⊢ False
interval_cases m refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4}hlt:1 < 2hm1:0 < 1⊢ False
· refine_2.«1» m:ℕhm:1 ∈ {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4}hlt:1 < 2hm1:0 < 1⊢ False revert hm refine_2.«1» m:ℕhlt:1 < 2hm1:0 < 1⊢ 1 ∈ {m | 0 < m ∧ m + 5 ∣ nth Nat.Prime (m - 1) + nth Nat.Prime 4} → False; norm_num [Nat.nth_prime_zero_eq_two, Nat.nth_prime_four_eq_eleven] All goals completed! 🐙Conjecture: $a(n)$ exists for any $n > 0$. The existence of $a(n)$ for $n > 0$ is formalized by requiring that the defining set is nonempty (equivalently, $0 < a(n)$).
Zhi-Wei Sun, Sep 25 2014
@[category research open, AMS 11]
theorem conjecture_1 (n : ℕ) (hn : 0 < n) :
({ m : ℕ | 0 < m ∧
(m + n) ∣ (Nat.nth Nat.Prime (m - 1) + Nat.nth Nat.Prime (n - 1)) }).Nonempty := by n:ℕhn:0 < n⊢ {m | 0 < m ∧ m + n ∣ nth Nat.Prime (m - 1) + nth Nat.Prime (n - 1)}.Nonempty
sorry All goals completed! 🐙Conjecture: $a(n) < n(n-1)$ for all $n > 2$.
Zhi-Wei Sun, Sep 25 2014
Disproved by Khai-Hoan Nguyen-Dang (Oct 30 2026), who found the counterexample $n = 1322164$, for which $a(1322164) = 2636932401176 > 1748116320732 = 1322164 \cdot 1322163$.
@[category research solved, AMS 11]
theorem conjecture_2 : ¬ ∀ n : ℕ, 2 < n → a n < n * (n - 1) := by ⊢ ¬∀ (n : ℕ), 2 < n → OeisA247824.a n < n * (n - 1)
sorry All goals completed! 🐙end OeisA247824