Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

φ(1)+φ(p)+φ(p2)+⋯+φ(pα)=pα\varphi(1)+\varphi(p)+\varphi(p^2)+\dots+\varphi(p^\alpha)=p^\alphaφ(1)+φ(p)+φ(p2)+⋯+φ(pα)=pα

Proved
AlfutovaUstinov.problem_4_133

by evgeth · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

elementary-number-theoryeuler-totientnumber-theory

This is Problem 4.133 of N. B. Alfutova and A. V. Ustinov, Algebra and Number Theory (MCCME, 2002), Chapter 4, §4 “Theorems of Fermat and Euler”. The problem asks for the value of the sum φ(1)+φ(p)+φ(p2)+⋯+φ(pα)\varphi(1)+\varphi(p)+\varphi(p^2)+\dots+\varphi(p^\alpha)φ(1)+φ(p)+φ(p2)+⋯+φ(pα), where φ\varphiφ is Euler's function, ppp is a prime (as in the preceding Problem 4.132) and α\alphaα is a natural number. The book's answer is pαp^{\alpha}pα.

Theorem. For every prime ppp and every α∈N\alpha\in\mathbb Nα∈N,

∑i=0αφ ⁣(pi)=φ(1)+φ(p)+⋯+φ(pα)=pα.\sum_{i=0}^{\alpha}\varphi\!\left(p^{i}\right)=\varphi(1)+\varphi(p)+\dots+\varphi(p^{\alpha}) = p^{\alpha}.i=0∑α​φ(pi)=φ(1)+φ(p)+⋯+φ(pα)=pα.

This is the prime-power case of Gauss's identity ∑d∣nφ(d)=n\sum_{d\mid n}\varphi(d)=n∑d∣n​φ(d)=n.

Formalization Note Euler's function is Nat.totient. The statement is proved for all α∈N\alpha\in\mathbb Nα∈N, including α=0\alpha=0α=0 (where it reads φ(1)=1\varphi(1)=1φ(1)=1), which contains the book's case α≥1\alpha\ge 1α≥1.

Preamble
import Mathlib
Formal statement
namespace AlfutovaUstinov

theorem problem_4_133 (p : ℕ) (hp : p.Prime) (α : ℕ) :
    ∑ i ∈ Finset.range (α + 1), Nat.totient (p ^ i) = p ^ α := by sorry

end AlfutovaUstinov
Source
N. B. Alfutova, A. V. Ustinov, «Алгебра и теория чисел. Сборник задач для математических школ» (Algebra and Number Theory: a problem book for mathematical schools), Moscow: MCCME, 2002, Chapter 4 «Арифметика остатков» (Arithmetic of residues), §4 «Теоремы Ферма и Эйлера» (Theorems of Fermat and Euler), Problem 4.133. Problem text and answer as catalogued on problems.ru, problem 60759: https://problems.ru/view_problem_details_new.php?id=60759

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