FormalConjectures.Wikipedia.Grimm

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

import FormalConjecturesUtil

Grimm's conjecture

Reference: Wikipedia


open Function


namespace Grimm

Grimm's Conjecture If $n, n+1, \dots, n+k-1$ are all composite numbers, then there are $k$ distinct primes $p_i$ such that $p_i$ divides $n + i$ for all $0 \le i \le k-1$.

@[category research open, AMS 11]
theorem declaration uses 'sorry'grimm_conjecture (n k : ℕ) (hn : 1 ≤ n) (hk : 1 ≤ k)
    (h : ∀ i : Fin k, (n + i).Composite) :
    ∃ ps : Fin k ↪ ℕ,  ∀ i : Fin k, (ps i).Prime ∧ ps i ∣ (n + i) := byn:ℕk:ℕhn:1 ≤ nhk:1 ≤ kh:∀ (i : Fin k), (n + ↑i).Composite⊢ ∃ ps, ∀ (i : Fin k), Nat.Prime (ps i) ∧ ps i ∣ n + ↑i
  sorryAll goals completed! 🐙

Grimm's Conjecture, weaker version If $n, n+1, \dots, n+k-1$ are all composite numbers, then their product has at least $k$ distinct prime divisors.

@[category research open, AMS 11]
theorem declaration uses 'sorry'grimm_conjecture_weak (n k : ℕ) (hn : 1 ≤ n) (hk : 1 ≤ k)
    (h : ∀ i : Fin k, (n + i).Composite) :
    ∃ ps : Fin k ↪ ℕ,  ∀ i : Fin k, (ps i).Prime ∧ ∃ j : Fin k, ps i ∣ (n + j) := byn:ℕk:ℕhn:1 ≤ nhk:1 ≤ kh:∀ (i : Fin k), (n + ↑i).Composite⊢ ∃ ps, ∀ (i : Fin k), Nat.Prime (ps i) ∧ ∃ j, ps i ∣ n + ↑j
  sorryAll goals completed! 🐙


end Grimm