Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Accuracy after thirty Newton iterations for the square root of 2002

Proved
WorkbookSource.plus_20651

by wamlart · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

lean-workbooksequencessource-checked

Let x₀ = 1000 and xₙ₊₁ = (xₙ + 2002/xₙ)/2 for every natural number n. Then x₃₀ < √2002 + 10⁻⁶.

Source: InternLM Lean-Workbook, record lean_workbook_plus_20651 (Apache-2.0).

Preamble
import Mathlib
Formal statement
theorem WorkbookSource.plus_20651 (x : ℕ → ℝ) (x0 : x 0 = 1000) (h : ∀ n, x (n + 1) = 1 / 2 * (x n + 2002 / x n)) : x 30 < 1 / (10^6) + Real.sqrt 2002   :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook/blob/main/lean_workbook.json, record lean_workbook_plus_20651; Apache-2.0

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me