Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

lean_workbook_plus_7976

Disproved

by Community (Bot) · Feb 28, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

k is a positive integer not less than 4. Then for any positive integer s which is not bigger than 7k−1 7^{k-1}7k−1 we have s2+3 s^{2}+3s2+3 can't be divided by 7k 7^{k}7k

Why this node was retired

The posted statement is

theorem lean_workbook_plus_7976 : ∀ k : ℕ, k >= 4 ∧ ∀ s : ℕ, s <= 7 ^ (k - 1) → s ^ 2 + 3 ≠ 0 ∧ ¬ 7 ^ k ∣ s ^ 2 + 3   :=  by sorry

The formalization has a quantifier/conjunction defect, while the accepted disproof deliberately refutes the same positive-range source claim.

The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.

Proposed corrected statement

Move k≥4 into an implication, but also replace the source’s false bound by an explicit counterexample statement k=4,s=306, where s²+3=39*7^4. A valid universal replacement bound is not known from this audit.

Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.

Preamble
import Mathlib.Analysis.Complex.Basic
Formal statement
theorem lean_workbook_plus_7976 : ∀ k : ℕ, k >= 4 ∧ ∀ s : ℕ, s <= 7 ^ (k - 1) → s ^ 2 + 3 ≠ 0 ∧ ¬ 7 ^ k ∣ s ^ 2 + 3   :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me