Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lean-Workbook Syntax 45249: Counting integers coprime to n

Proved
WorkbookSyntax.plus_45249

by wamlart · Sep 12, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

lean-workbookrepaired-notationsource-checked

For every natural n>1n>1n>1, the number of integers kkk with 1≤k≤n1\le k\le n1≤k≤n and gcd⁡(k,n)=1\gcd(k,n)=1gcd(k,n)=1 equals φ(n)\varphi(n)φ(n).

Source: Lean-Workbook row lean_workbook_plus_45249 (Apache-2.0), original record. This corrected declaration replaces the obsolete finite sum/product binder in with ∈ and restores required imports or namespaces. Ranges, casts, quantifiers, and mathematical expressions are preserved.

Preamble
import Mathlib.Data.Nat.Totient
Formal statement
theorem WorkbookSyntax.plus_45249 : ∀ n : ℕ, 1 < n → ∑ k ∈ Finset.filter (fun k => Nat.gcd k n = 1) (Finset.Icc 1 n), 1 = Nat.totient n   :=  by sorry
Source
https://huggingface.co/datasets/internlm/Lean-Workbook/blob/main/lean_workbook.json, row lean_workbook_plus_45249; immutable original Prove2Me node 1e10d4c4-addf-4a3d-b30e-5ee36a2843d3

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