/-
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 FormalConjecturesUtilSmallest integer $s > n$ such that $1 + 2s + 3s^2 + \dots + n s^{n-1}$ is prime
For $n \ge 2$, $a(n)$ is the smallest integer $s > n$ such that the sum $P_n(s) = \sum_{k=0}^{n-1} (k+1) s^k$ is a prime number.
References:
@[expose] public sectionnamespace OeisA217785
polyP n s is the sum $\sum_{k=0}^{n-1} (k+1) s^k$.
def polyP (n s : ℕ) : ℕ :=
∑ k ∈ Finset.range n, (k + 1) * s ^ kopen scoped Classical in
Smallest integer $s > n$ such that polyP n s is prime,
or none if no such $s$ exists.
noncomputable def a (n : ℕ) : Option ℕ :=
if ∃ s : ℕ, n < s ∧ Nat.Prime (polyP n s) then
some (sInf {s : ℕ | n < s ∧ Nat.Prime (polyP n s)})
else
noneAll goals completed! 🐙
@[category test, AMS 11]
theorem a_3 : a 3 = some 12 := by ⊢ a 3 = some 12
have h : IsLeast {s : ℕ | 3 < s ∧ Nat.Prime (polyP 3 s)} 12 := by
refine ⟨by ⊢ 12 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)} h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12 norm_num [polyP] All goals completed! 🐙 h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12, fun x hx => ?_⟩
by_contra! h x:ℕhx:x ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:x < 12⊢ False h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12
interval_cases x «0» x:ℕhx:0 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:0 < 12⊢ False«1» x:ℕhx:1 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:1 < 12⊢ False«2» x:ℕhx:2 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:2 < 12⊢ False«3» x:ℕhx:3 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:3 < 12⊢ False«4» x:ℕhx:4 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:4 < 12⊢ False«5» x:ℕhx:5 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:5 < 12⊢ False«6» x:ℕhx:6 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:6 < 12⊢ False«7» x:ℕhx:7 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:7 < 12⊢ False«8» x:ℕhx:8 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:8 < 12⊢ False«9» x:ℕhx:9 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:9 < 12⊢ False«10» x:ℕhx:10 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:10 < 12⊢ False«11» x:ℕhx:11 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:11 < 12⊢ False h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12 <;> «0» x:ℕhx:0 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:0 < 12⊢ False«1» x:ℕhx:1 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:1 < 12⊢ False«2» x:ℕhx:2 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:2 < 12⊢ False«3» x:ℕhx:3 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:3 < 12⊢ False«4» x:ℕhx:4 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:4 < 12⊢ False«5» x:ℕhx:5 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:5 < 12⊢ False«6» x:ℕhx:6 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:6 < 12⊢ False«7» x:ℕhx:7 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:7 < 12⊢ False«8» x:ℕhx:8 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:8 < 12⊢ False«9» x:ℕhx:9 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:9 < 12⊢ False«10» x:ℕhx:10 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:10 < 12⊢ False«11» x:ℕhx:11 ∈ {s | 3 < s ∧ Nat.Prime (polyP 3 s)}h:11 < 12⊢ False h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12 norm_num [polyP] at hx h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12 h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12⊢ a 3 = some 12
have h_ex : ∃ s : ℕ, 3 < s ∧ Nat.Prime (polyP 3 s) := ⟨12, h.1⟩ h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12h_ex:∃ s, 3 < s ∧ Nat.Prime (polyP 3 s)⊢ a 3 = some 12
rw [a, h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12h_ex:∃ s, 3 < s ∧ Nat.Prime (polyP 3 s)⊢ (if ∃ s, 3 < s ∧ Nat.Prime (polyP 3 s) then some (sInf {s | 3 < s ∧ Nat.Prime (polyP 3 s)}) else none) = some 12 All goals completed! 🐙 if_pos h_ex, h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12h_ex:∃ s, 3 < s ∧ Nat.Prime (polyP 3 s)⊢ some (sInf {s | 3 < s ∧ Nat.Prime (polyP 3 s)}) = some 12 All goals completed! 🐙 h.csInf_eq h:IsLeast {s | 3 < s ∧ Nat.Prime (polyP 3 s)} 12h_ex:∃ s, 3 < s ∧ Nat.Prime (polyP 3 s)⊢ some 12 = some 12 All goals completed! 🐙] All goals completed! 🐙
@[category test, AMS 11]
theorem a_4 : a 4 = some 12 := by ⊢ a 4 = some 12
have h : IsLeast {s : ℕ | 4 < s ∧ Nat.Prime (polyP 4 s)} 12 := by
refine ⟨by ⊢ 12 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)} h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12 norm_num [polyP] All goals completed! 🐙 h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12, fun x hx => ?_⟩
by_contra! h x:ℕhx:x ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:x < 12⊢ False h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12
interval_cases x «0» x:ℕhx:0 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:0 < 12⊢ False«1» x:ℕhx:1 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:1 < 12⊢ False«2» x:ℕhx:2 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:2 < 12⊢ False«3» x:ℕhx:3 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:3 < 12⊢ False«4» x:ℕhx:4 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:4 < 12⊢ False«5» x:ℕhx:5 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:5 < 12⊢ False«6» x:ℕhx:6 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:6 < 12⊢ False«7» x:ℕhx:7 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:7 < 12⊢ False«8» x:ℕhx:8 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:8 < 12⊢ False«9» x:ℕhx:9 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:9 < 12⊢ False«10» x:ℕhx:10 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:10 < 12⊢ False«11» x:ℕhx:11 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:11 < 12⊢ False h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12 <;> «0» x:ℕhx:0 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:0 < 12⊢ False«1» x:ℕhx:1 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:1 < 12⊢ False«2» x:ℕhx:2 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:2 < 12⊢ False«3» x:ℕhx:3 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:3 < 12⊢ False«4» x:ℕhx:4 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:4 < 12⊢ False«5» x:ℕhx:5 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:5 < 12⊢ False«6» x:ℕhx:6 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:6 < 12⊢ False«7» x:ℕhx:7 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:7 < 12⊢ False«8» x:ℕhx:8 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:8 < 12⊢ False«9» x:ℕhx:9 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:9 < 12⊢ False«10» x:ℕhx:10 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:10 < 12⊢ False«11» x:ℕhx:11 ∈ {s | 4 < s ∧ Nat.Prime (polyP 4 s)}h:11 < 12⊢ False h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12 norm_num [polyP] at hx h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12 h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12⊢ a 4 = some 12
have h_ex : ∃ s : ℕ, 4 < s ∧ Nat.Prime (polyP 4 s) := ⟨12, h.1⟩ h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12h_ex:∃ s, 4 < s ∧ Nat.Prime (polyP 4 s)⊢ a 4 = some 12
rw [a, h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12h_ex:∃ s, 4 < s ∧ Nat.Prime (polyP 4 s)⊢ (if ∃ s, 4 < s ∧ Nat.Prime (polyP 4 s) then some (sInf {s | 4 < s ∧ Nat.Prime (polyP 4 s)}) else none) = some 12 All goals completed! 🐙 if_pos h_ex, h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12h_ex:∃ s, 4 < s ∧ Nat.Prime (polyP 4 s)⊢ some (sInf {s | 4 < s ∧ Nat.Prime (polyP 4 s)}) = some 12 All goals completed! 🐙 h.csInf_eq h:IsLeast {s | 4 < s ∧ Nat.Prime (polyP 4 s)} 12h_ex:∃ s, 4 < s ∧ Nat.Prime (polyP 4 s)⊢ some 12 = some 12 All goals completed! 🐙] All goals completed! 🐙
@[category test, AMS 11]
theorem a_5 : a 5 = some 9 := by ⊢ a 5 = some 9
have h : IsLeast {s : ℕ | 5 < s ∧ Nat.Prime (polyP 5 s)} 9 := by
refine ⟨by ⊢ 9 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)} h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9 norm_num [polyP] All goals completed! 🐙 h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9, fun x hx => ?_⟩
by_contra! h x:ℕhx:x ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:x < 9⊢ False h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9
interval_cases x «0» x:ℕhx:0 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:0 < 9⊢ False«1» x:ℕhx:1 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:1 < 9⊢ False«2» x:ℕhx:2 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:2 < 9⊢ False«3» x:ℕhx:3 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:3 < 9⊢ False«4» x:ℕhx:4 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:4 < 9⊢ False«5» x:ℕhx:5 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:5 < 9⊢ False«6» x:ℕhx:6 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:6 < 9⊢ False«7» x:ℕhx:7 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:7 < 9⊢ False«8» x:ℕhx:8 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:8 < 9⊢ False h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9 <;> «0» x:ℕhx:0 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:0 < 9⊢ False«1» x:ℕhx:1 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:1 < 9⊢ False«2» x:ℕhx:2 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:2 < 9⊢ False«3» x:ℕhx:3 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:3 < 9⊢ False«4» x:ℕhx:4 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:4 < 9⊢ False«5» x:ℕhx:5 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:5 < 9⊢ False«6» x:ℕhx:6 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:6 < 9⊢ False«7» x:ℕhx:7 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:7 < 9⊢ False«8» x:ℕhx:8 ∈ {s | 5 < s ∧ Nat.Prime (polyP 5 s)}h:8 < 9⊢ False h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9 norm_num [polyP] at hx h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9 h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9⊢ a 5 = some 9
have h_ex : ∃ s : ℕ, 5 < s ∧ Nat.Prime (polyP 5 s) := ⟨9, h.1⟩ h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9h_ex:∃ s, 5 < s ∧ Nat.Prime (polyP 5 s)⊢ a 5 = some 9
rw [a, h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9h_ex:∃ s, 5 < s ∧ Nat.Prime (polyP 5 s)⊢ (if ∃ s, 5 < s ∧ Nat.Prime (polyP 5 s) then some (sInf {s | 5 < s ∧ Nat.Prime (polyP 5 s)}) else none) = some 9 All goals completed! 🐙 if_pos h_ex, h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9h_ex:∃ s, 5 < s ∧ Nat.Prime (polyP 5 s)⊢ some (sInf {s | 5 < s ∧ Nat.Prime (polyP 5 s)}) = some 9 All goals completed! 🐙 h.csInf_eq h:IsLeast {s | 5 < s ∧ Nat.Prime (polyP 5 s)} 9h_ex:∃ s, 5 < s ∧ Nat.Prime (polyP 5 s)⊢ some 9 = some 9 All goals completed! 🐙] All goals completed! 🐙
@[category test, AMS 11]
theorem a_6 : a 6 = some 21 := by ⊢ a 6 = some 21
have h : IsLeast {s : ℕ | 6 < s ∧ Nat.Prime (polyP 6 s)} 21 := by
refine ⟨by ⊢ 21 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)} h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21 norm_num [polyP] All goals completed! 🐙 h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21, fun x hx => ?_⟩
by_contra! h x:ℕhx:x ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:x < 21⊢ False h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21
interval_cases x «0» x:ℕhx:0 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:0 < 21⊢ False«1» x:ℕhx:1 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:1 < 21⊢ False«2» x:ℕhx:2 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:2 < 21⊢ False«3» x:ℕhx:3 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:3 < 21⊢ False«4» x:ℕhx:4 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:4 < 21⊢ False«5» x:ℕhx:5 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:5 < 21⊢ False«6» x:ℕhx:6 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:6 < 21⊢ False«7» x:ℕhx:7 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:7 < 21⊢ False«8» x:ℕhx:8 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:8 < 21⊢ False«9» x:ℕhx:9 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:9 < 21⊢ False«10» x:ℕhx:10 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:10 < 21⊢ False«11» x:ℕhx:11 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:11 < 21⊢ False«12» x:ℕhx:12 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:12 < 21⊢ False«13» x:ℕhx:13 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:13 < 21⊢ False«14» x:ℕhx:14 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:14 < 21⊢ False«15» x:ℕhx:15 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:15 < 21⊢ False«16» x:ℕhx:16 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:16 < 21⊢ False«17» x:ℕhx:17 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:17 < 21⊢ False«18» x:ℕhx:18 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:18 < 21⊢ False«19» x:ℕhx:19 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:19 < 21⊢ False«20» x:ℕhx:20 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:20 < 21⊢ False h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21 <;> «0» x:ℕhx:0 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:0 < 21⊢ False«1» x:ℕhx:1 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:1 < 21⊢ False«2» x:ℕhx:2 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:2 < 21⊢ False«3» x:ℕhx:3 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:3 < 21⊢ False«4» x:ℕhx:4 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:4 < 21⊢ False«5» x:ℕhx:5 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:5 < 21⊢ False«6» x:ℕhx:6 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:6 < 21⊢ False«7» x:ℕhx:7 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:7 < 21⊢ False«8» x:ℕhx:8 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:8 < 21⊢ False«9» x:ℕhx:9 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:9 < 21⊢ False«10» x:ℕhx:10 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:10 < 21⊢ False«11» x:ℕhx:11 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:11 < 21⊢ False«12» x:ℕhx:12 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:12 < 21⊢ False«13» x:ℕhx:13 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:13 < 21⊢ False«14» x:ℕhx:14 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:14 < 21⊢ False«15» x:ℕhx:15 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:15 < 21⊢ False«16» x:ℕhx:16 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:16 < 21⊢ False«17» x:ℕhx:17 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:17 < 21⊢ False«18» x:ℕhx:18 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:18 < 21⊢ False«19» x:ℕhx:19 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:19 < 21⊢ False«20» x:ℕhx:20 ∈ {s | 6 < s ∧ Nat.Prime (polyP 6 s)}h:20 < 21⊢ False h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21 norm_num [polyP] at hx h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21 h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21⊢ a 6 = some 21
have h_ex : ∃ s : ℕ, 6 < s ∧ Nat.Prime (polyP 6 s) := ⟨21, h.1⟩ h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21h_ex:∃ s, 6 < s ∧ Nat.Prime (polyP 6 s)⊢ a 6 = some 21
rw [a, h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21h_ex:∃ s, 6 < s ∧ Nat.Prime (polyP 6 s)⊢ (if ∃ s, 6 < s ∧ Nat.Prime (polyP 6 s) then some (sInf {s | 6 < s ∧ Nat.Prime (polyP 6 s)}) else none) = some 21 All goals completed! 🐙 if_pos h_ex, h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21h_ex:∃ s, 6 < s ∧ Nat.Prime (polyP 6 s)⊢ some (sInf {s | 6 < s ∧ Nat.Prime (polyP 6 s)}) = some 21 All goals completed! 🐙 h.csInf_eq h:IsLeast {s | 6 < s ∧ Nat.Prime (polyP 6 s)} 21h_ex:∃ s, 6 < s ∧ Nat.Prime (polyP 6 s)⊢ some 21 = some 21 All goals completed! 🐙] All goals completed! 🐙The polynomial $s_n(x) = \sum_{k=0}^n (k+1) x^k$ over $\mathbb{Z}[x]$.
noncomputable def polyS (n : ℕ) : Polynomial ℤ :=
∑ k ∈ Finset.range (n + 1), Polynomial.C (k + 1 : ℤ) * Polynomial.X ^ kConjecture: For each $n \ge 2$, there are infinitely many primes of the form $1 + 2s + \dots + n s^{n-1}$ where $s$ is a positive integer.
@[category research open, AMS 11]
theorem conjecture_1 (n : ℕ) (hn : 2 ≤ n) :
{s : ℕ | 0 < s ∧ Nat.Prime (polyP n s)}.Infinite := by n:ℕhn:2 ≤ n⊢ {s | 0 < s ∧ Nat.Prime (polyP n s)}.Infinite
sorry All goals completed! 🐙Conjecture: For each $n \ge 2$, $a(n) < 12 n^2$.
@[category research open, AMS 11]
theorem conjecture_2 (n : ℕ) (hn : 2 ≤ n) :
∃ m < 12 * n ^ 2, a n = some m := by n:ℕhn:2 ≤ n⊢ ∃ m < 12 * n ^ 2, a n = some m
sorry All goals completed! 🐙Conjecture: The polynomials $s_n(x) = \sum_{k=0}^n (k+1) x^k$ for $n \ge 1$ are all irreducible over the field of rational numbers.
@[category research open, AMS 11 12]
theorem conjecture_3 (n : ℕ) (hn : 1 ≤ n) :
Irreducible (Polynomial.map (Int.castRingHom ℚ) (polyS n)) := by n:ℕhn:1 ≤ n⊢ Irreducible (Polynomial.map (Int.castRingHom ℚ) (polyS n))
sorry All goals completed! 🐙Conjecture: For $n \ge 1$, the polynomial $s_n(x) = \sum_{k=0}^n (k+1) x^k$ is reducible modulo every prime if and only if $n$ has the form $8k(k+1)$ where $k$ is a positive integer.
@[category research open, AMS 11 12]
theorem conjecture_4 (n : ℕ) (hn : 1 ≤ n) :
(∀ p : ℕ, p.Prime → ¬ Irreducible (Polynomial.map (Int.castRingHom (ZMod p)) (polyS n))) ↔
∃ k : ℕ, 0 < k ∧ n = 8 * k * (k + 1) := by n:ℕhn:1 ≤ n⊢ (∀ (p : ℕ), Nat.Prime p → ¬Irreducible (Polynomial.map (Int.castRingHom (ZMod p)) (polyS n))) ↔
∃ k, 0 < k ∧ n = 8 * k * (k + 1)
sorry All goals completed! 🐙end OeisA217785