Solving , , and
ProvedAlfutovaUstinov.problem_4_139diophantine-equationselementary-number-theoryeuler-totientnumber-theory
This is Problem 4.139 of N. B. Alfutova and A. V. Ustinov, Algebra and Number Theory (MCCME, 2002), Chapter 4, §4 “Theorems of Fermat and Euler”. Here denotes Euler's function: is the number of integers among coprime to . The problem asks to solve the equations (a) ; (b) ; (c) ; (d) in natural numbers . The book's answers are recorded below.
Theorem. The complete sets of natural solutions are
- ;
- ;
- ;
Part 4 shows that is a nontotient: an even number that is not a value of Euler's function.
Formalization Note Euler's function is Nat.totient; each part is stated as an equality of subsets of . Mathlib's convention means that never solves these equations, so quantifying over all of agrees with the book's natural numbers .
Preamble
import Mathlib
Formal statement
namespace AlfutovaUstinov
theorem problem_4_139 :
{x : ℕ | Nat.totient x = 2} = {3, 4, 6} ∧
{x : ℕ | Nat.totient x = 8} = {15, 16, 20, 24, 30} ∧
{x : ℕ | Nat.totient x = 12} = {13, 21, 26, 28, 36, 42} ∧
{x : ℕ | Nat.totient x = 14} = ∅ := 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.139. Problem text and answer as catalogued on problems.ru, problem 60765: https://problems.ru/view_problem_details_new.php?id=60765