/- Copyright 2025 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 FormalConjecturesUtil

Erdős Problem 371

References:

    erdosproblems.com/371

    [OAI26a] OpenAI, The joint Dickman law for consecutive integers. OpenAI Math Release preprint (2026). https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/The-joint-Dickman-law-for-consecutive-integers-September-24-2026/paper.pdf

@[expose] public sectionnamespace Erdos371

Let $P(n)$ denote the largest prime factor of $n$. Show that the set of $n$ with $P(n+1) > P(n)$ has density $\frac{1}{2}$.

This was proved by an internal OpenAI model in September 2026 [OAI26a]; see the linked Lean proof.

@[category research solved, AMS 11, formal_proof using lean4 at "https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/NumberTheory/JointDickman/PaperMain.lean#L21"] theorem erdos_371 : { n | Nat.maxPrimeFac (n + 1) > Nat.maxPrimeFac n }.HasDensity (1/2) := ⊢ {n | (n + 1).maxPrimeFac > n.maxPrimeFac}.HasDensity (1 / 2) All goals completed! 🐙-- TODO: add the statements from the additional material end Erdos371