/-
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 FormalConjecturesUtilNumerator of $1/\det(M)$ for $M[i,j] = 1/\operatorname{lcm}(i,j)$
Numerator of $1/\det(M)$ where $M$ is the $n \times n$ matrix with $M[i,j] = 1/\operatorname{lcm}(i,j)$.
References:
T. Adamczewski, "OEIS Open: How many conjectures can language models turn into theorems?", arXiv:2608.11941 [cs.AI], 2026.
@[expose] public sectionnamespace OeisA60841The $n \times n$ matrix with entry $(i,j)$ equal to $1/\operatorname{lcm}(i+1, j+1)$ over $\mathbb{Q}$.
def lcmMatrix (n : ℕ) : Matrix (Fin n) (Fin n) ℚ :=
Matrix.of fun i j : Fin n ↦ 1 / ((Nat.lcm (i.val + 1) (j.val + 1) : ℚ))Numerator of $1/\det(M)$ where $M$ is the $n \times n$ matrix with $M[i,j] = 1/\operatorname{lcm}(i+1,j+1)$.
def a (n : ℕ) : ℤ :=
((lcmMatrix n).det)⁻¹.num@[category test, AMS 11 15]
theorem a_1 : a 1 = 1 := ⊢ a 1 = 1
All goals completed! 🐙@[category test, AMS 11 15]
theorem a_2 : a 2 = 4 := ⊢ a 2 = 4
All goals completed! 🐙@[category test, AMS 11 15]
theorem a_3 : a 3 = 18 := ⊢ a 3 = 18
All goals completed! 🐙@[category test, AMS 11 15]
theorem a_4 : a 4 = 144 := ⊢ a 4 = 144
All goals completed! 🐙@[category test, AMS 11 15]
theorem a_5 : a 5 = 900 := ⊢ a 5 = 900
All goals completed! 🐙The exceptional values of $n$ where $1/\det(M)$ is conjectured to be an integer.
def integerDetN : Set ℕ :=
Set.Icc 1 34 ∪ {36, 38}"Conjecture: $1/\det(M)$ is an integer only for n: 1 to 34, 36 and 38." - Robert G. Wilson v, Aug 02 2015
@[category research open, AMS 11 15]
theorem conjecture1 :
∀ n : ℕ, 1 ≤ n → (((lcmMatrix n).det)⁻¹.den = 1 ↔ n ∈ integerDetN) := ⊢ ∀ (n : ℕ), 1 ≤ n → ((lcmMatrix n).det⁻¹.den = 1 ↔ n ∈ integerDetN)
All goals completed! 🐙"All denominators are powers of two (A000079)." - Robert G. Wilson v, Aug 02 2015
This is false: for $n = 1807$ the denominator of $1/\det(M)$ is divisible by $3$. See T. Adamczewski, OEIS Open: How many conjectures can language models turn into theorems?, arXiv:2608.11941. The Lean disproof there uses the closed form $1/\det(M) = \prod_{k=1}^n k^2/\varphi(k)$ from the OEIS entry: https://github.com/epoch-research/LeanOpenProblems-results/blob/fd09021e79869476ef83cda231312f1a2a89c8d7/runs/oeis-full-50usd-ant-j0j0g4uzligm1k41/oeis_60841_conjecture_0/Submission/Spec.lean#L272
@[category research solved, AMS 11 15, formal_proof using lean4 at "https://github.com/anatoliiohorodnyk/lean-fc-proofs/blob/5da9642575b26c2c816a49bcb56b33fed5456619/Proofs/T_OeisA60841_conjecture2.lean#L377"]
theorem conjecture2 :
¬ ∀ n : ℕ, 1 ≤ n → ∃ k : ℕ, ((lcmMatrix n).det)⁻¹.den = 2 ^ k := ⊢ ¬∀ (n : ℕ), 1 ≤ n → ∃ k, (lcmMatrix n).det⁻¹.den = 2 ^ k
All goals completed! 🐙end OeisA60841