Proved
AlfutovaUstinov.problem_4_133elementary-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 , where is Euler's function, is a prime (as in the preceding Problem 4.132) and is a natural number. The book's answer is .
Theorem. For every prime and every ,
This is the prime-power case of Gauss's identity .
Formalization Note Euler's function is Nat.totient. The statement is proved for all , including (where it reads ), which contains the book's case .
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 AlfutovaUstinovSource
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