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

The prime numbers

The $n$-th prime number $p_n$, where $p_1 = 2$.

References:

namespace OeisA40

The sequence of prime numbers, with $a(0) = 0$ and $a(n) = p_n$ for $n \ge 1$.

noncomputable def a (n : ) : := match n with | 0 => 0 | n' + 1 => Nat.nth Nat.Prime n'

Value of the sequence a at 0.

@[category test, AMS 11] theorem a_0 : a 0 = 0 := a 0 = 0 All goals completed! 🐙

Value of the sequence a at 1.

@[category test, AMS 11] theorem a_1 : a 1 = 2 := a 1 = 2 Nat.nth Nat.Prime 0 = 2 All goals completed! 🐙

Value of the sequence a at 2.

@[category test, AMS 11] theorem a_2 : a 2 = 3 := a 2 = 3 Nat.nth Nat.Prime 1 = 3 All goals completed! 🐙

Value of the sequence a at 3.

@[category test, AMS 11] theorem a_3 : a 3 = 5 := a 3 = 5 Nat.nth Nat.Prime 2 = 5 All goals completed! 🐙

Value of the sequence a at 4.

@[category test, AMS 11] theorem a_4 : a 4 = 7 := a 4 = 7 Nat.nth Nat.Prime 3 = 7 All goals completed! 🐙

Conjecture from Thomas Ordowski (2023): $\log \log a(n+1) - \log \log a(n) < 1/n$ for $n > 0$.

@[category research open, AMS 11] theorem conjecture (n : ) (hn : 0 < n) : Real.log (Real.log (a (n + 1) : )) - Real.log (Real.log (a n : )) < 1 / (n : ) := n:hn:0 < nReal.log (Real.log (a (n + 1))) - Real.log (Real.log (a n)) < 1 / n All goals completed! 🐙end OeisA40