/-
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 FormalConjecturesUtilNumber of primes between $n^3 - n$ and $n^3$
For $n \ge 1$, $a(n)$ is the number of primes $p$ satisfying $n^3 - n < p \le n^3$, given by $\pi(n^3) - \pi(n^3 - n)$.
References:
@[expose] public sectionnamespace OeisA216265Number of primes between $n^3 - n$ and $n^3$.
def a (n : ℕ) : ℕ :=
Nat.primeCounting (n ^ 3) - Nat.primeCounting (n ^ 3 - n)@[category test, AMS 11]
theorem a_1 : a 1 = 0 := ⊢ a 1 = 0 All goals completed! 🐙@[category test, AMS 11]
theorem a_2 : a 2 = 1 := ⊢ a 2 = 1 All goals completed! 🐙@[category test, AMS 11]
theorem a_3 : a 3 = 0 := ⊢ a 3 = 0 All goals completed! 🐙hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 60 + 1 - Nat.primeCounting 60 = 1
omega All goals completed! 🐙
@[category test, AMS 11]
theorem a_5 : a 5 = 0 := by ⊢ a 5 = 0
have hn : ∀ {k : ℕ}, ¬ (k + 1).Prime →
Nat.primeCounting (k + 1) = Nat.primeCounting k := fun {k} h => by k:ℕh:¬Nat.Prime (k + 1)⊢ (k + 1).primeCounting = k.primeCounting hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0
rw [← Nat.primesLE_card_eq_primeCounting, k:ℕh:¬Nat.Prime (k + 1)⊢ (k + 1).primesLE.card = k.primeCounting hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0 ← Nat.primesLE_card_eq_primeCounting, k:ℕh:¬Nat.Prime (k + 1)⊢ (k + 1).primesLE.card = k.primesLE.card hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0
Nat.primesLE_succ, k:ℕh:¬Nat.Prime (k + 1)⊢ (if Nat.Prime (k + 1) then insert (k + 1) k.primesLE else k.primesLE).card = k.primesLE.card hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0 if_neg h k:ℕh:¬Nat.Prime (k + 1)⊢ k.primesLE.card = k.primesLE.card hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 5 = 0
rw [a, hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (5 ^ 3).primeCounting - (5 ^ 3 - 5).primeCounting = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (124 + 1).primeCounting - Nat.primeCounting 120 = 0 show 5 ^ 3 - 5 = 120 by ⊢ a 5 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (124 + 1).primeCounting - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (124 + 1).primeCounting - Nat.primeCounting 120 = 0, show 5 ^ 3 = 124 + 1 by ⊢ a 5 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (124 + 1).primeCounting - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (124 + 1).primeCounting - Nat.primeCounting 120 = 0] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (124 + 1).primeCounting - Nat.primeCounting 120 = 0
rw [hn (by hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (124 + 1) hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 124 - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 124 - Nat.primeCounting 120 = 0 : ¬ (124 + 1).Prime)] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 124 - Nat.primeCounting 120 = 0
rw [show (124 : ℕ) = 123 + 1 from rfl, hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (123 + 1).primeCounting - Nat.primeCounting 120 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 123 - Nat.primeCounting 120 = 0 hn (by hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (123 + 1) hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 123 - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 123 - Nat.primeCounting 120 = 0)] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 123 - Nat.primeCounting 120 = 0
rw [show (123 : ℕ) = 122 + 1 from rfl, hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (122 + 1).primeCounting - Nat.primeCounting 120 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 122 - Nat.primeCounting 120 = 0 hn (by hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (122 + 1) hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 122 - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 122 - Nat.primeCounting 120 = 0)] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 122 - Nat.primeCounting 120 = 0
rw [show (122 : ℕ) = 121 + 1 from rfl, hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (121 + 1).primeCounting - Nat.primeCounting 120 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 121 - Nat.primeCounting 120 = 0 hn (by hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (121 + 1) hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 121 - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 121 - Nat.primeCounting 120 = 0)] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 121 - Nat.primeCounting 120 = 0
rw [show (121 : ℕ) = 120 + 1 from rfl, hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (120 + 1).primeCounting - Nat.primeCounting 120 = 0 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 120 - Nat.primeCounting 120 = 0 hn (by hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (120 + 1) hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 120 - Nat.primeCounting 120 = 0 norm_num All goals completed! 🐙 hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 120 - Nat.primeCounting 120 = 0)] hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 120 - Nat.primeCounting 120 = 0
omega All goals completed! 🐙
@[category test, AMS 11]
theorem a_10 : a 10 = 2 := by ⊢ a 10 = 2
have hp : ∀ {k : ℕ}, (k + 1).Prime →
Nat.primeCounting (k + 1) = Nat.primeCounting k + 1 := fun {k} h => by k:ℕh:Nat.Prime (k + 1)⊢ (k + 1).primeCounting = k.primeCounting + 1 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2
rw [← Nat.primesLE_card_eq_primeCounting, k:ℕh:Nat.Prime (k + 1)⊢ (k + 1).primesLE.card = k.primeCounting + 1 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2 ← Nat.primesLE_card_eq_primeCounting, k:ℕh:Nat.Prime (k + 1)⊢ (k + 1).primesLE.card = k.primesLE.card + 1 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2
Nat.primesLE_succ, k:ℕh:Nat.Prime (k + 1)⊢ (if Nat.Prime (k + 1) then insert (k + 1) k.primesLE else k.primesLE).card = k.primesLE.card + 1 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2 if_pos h, k:ℕh:Nat.Prime (k + 1)⊢ (insert (k + 1) k.primesLE).card = k.primesLE.card + 1 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2 Finset.card_insert_of_notMem (Nat.notMem_primesLE k) k:ℕh:Nat.Prime (k + 1)⊢ k.primesLE.card + 1 = k.primesLE.card + 1 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1⊢ a 10 = 2
have hn : ∀ {k : ℕ}, ¬ (k + 1).Prime →
Nat.primeCounting (k + 1) = Nat.primeCounting k := fun {k} h => by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1k:ℕh:¬Nat.Prime (k + 1)⊢ (k + 1).primeCounting = k.primeCounting hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2
rw [← Nat.primesLE_card_eq_primeCounting, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1k:ℕh:¬Nat.Prime (k + 1)⊢ (k + 1).primesLE.card = k.primeCounting hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2 ← Nat.primesLE_card_eq_primeCounting, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1k:ℕh:¬Nat.Prime (k + 1)⊢ (k + 1).primesLE.card = k.primesLE.card hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2
Nat.primesLE_succ, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1k:ℕh:¬Nat.Prime (k + 1)⊢ (if Nat.Prime (k + 1) then insert (k + 1) k.primesLE else k.primesLE).card = k.primesLE.card hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2 if_neg h hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1k:ℕh:¬Nat.Prime (k + 1)⊢ k.primesLE.card = k.primesLE.card hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ a 10 = 2
rw [a, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (10 ^ 3).primeCounting - (10 ^ 3 - 10).primeCounting = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (999 + 1).primeCounting - Nat.primeCounting 990 = 2 show 10 ^ 3 - 10 = 990 by ⊢ a 10 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (999 + 1).primeCounting - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (999 + 1).primeCounting - Nat.primeCounting 990 = 2, show 10 ^ 3 = 999 + 1 by ⊢ a 10 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (999 + 1).primeCounting - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (999 + 1).primeCounting - Nat.primeCounting 990 = 2] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (999 + 1).primeCounting - Nat.primeCounting 990 = 2
rw [hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (999 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 999 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 999 - Nat.primeCounting 990 = 2 : ¬ (999 + 1).Prime)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 999 - Nat.primeCounting 990 = 2
rw [show (999 : ℕ) = 998 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (998 + 1).primeCounting - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 998 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (998 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 998 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 998 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 998 - Nat.primeCounting 990 = 2
rw [show (998 : ℕ) = 997 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (997 + 1).primeCounting - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 997 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (997 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 997 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 997 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 997 - Nat.primeCounting 990 = 2
rw [show (997 : ℕ) = 996 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (996 + 1).primeCounting - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 996 + 1 - Nat.primeCounting 990 = 2 hp (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.Prime (996 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 996 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 996 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 996 + 1 - Nat.primeCounting 990 = 2
rw [show (996 : ℕ) = 995 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (995 + 1).primeCounting + 1 - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 995 + 1 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (995 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 995 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 995 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 995 + 1 - Nat.primeCounting 990 = 2
rw [show (995 : ℕ) = 994 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (994 + 1).primeCounting + 1 - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 994 + 1 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (994 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 994 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 994 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 994 + 1 - Nat.primeCounting 990 = 2
rw [show (994 : ℕ) = 993 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (993 + 1).primeCounting + 1 - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 993 + 1 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (993 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 993 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 993 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 993 + 1 - Nat.primeCounting 990 = 2
rw [show (993 : ℕ) = 992 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (992 + 1).primeCounting + 1 - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 992 + 1 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (992 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 992 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 992 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 992 + 1 - Nat.primeCounting 990 = 2
rw [show (992 : ℕ) = 991 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (991 + 1).primeCounting + 1 - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 991 + 1 - Nat.primeCounting 990 = 2 hn (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ ¬Nat.Prime (991 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 991 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 991 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 991 + 1 - Nat.primeCounting 990 = 2
rw [show (991 : ℕ) = 990 + 1 from rfl, hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ (990 + 1).primeCounting + 1 - Nat.primeCounting 990 = 2 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 990 + 1 + 1 - Nat.primeCounting 990 = 2 hp (by hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.Prime (990 + 1) hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 990 + 1 + 1 - Nat.primeCounting 990 = 2 norm_num All goals completed! 🐙 hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 990 + 1 + 1 - Nat.primeCounting 990 = 2)] hp:∀ {k : ℕ}, Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting + 1hn:∀ {k : ℕ}, ¬Nat.Prime (k + 1) → (k + 1).primeCounting = k.primeCounting⊢ Nat.primeCounting 990 + 1 + 1 - Nat.primeCounting 990 = 2
omega All goals completed! 🐙Conjecture: For every $n > 13$, $a(n) > 0$.
@[category research open, AMS 11]
theorem conjecture (n : ℕ) (hn : 13 < n) : 0 < a n := by n:ℕhn:13 < n⊢ 0 < a n
sorry All goals completed! 🐙end OeisA216265