If , then divides or
ProvedAlfutovaUstinov.problem_4_123congruenceselementary-number-theoryfermat-little-theoremnumber-theory
This is Problem 4.123 of N. B. Alfutova and A. V. Ustinov, Algebra and Number Theory (MCCME, 2002), Chapter 4, §4 “Theorems of Fermat and Euler”.
Theorem. Let be a natural number that is not divisible by . Then
This is a direct application of Fermat's little theorem for the prime , where .
Formalization Note The number is a natural number, as in the book. The expression uses natural-number subtraction, which is exact here: the hypothesis forces , hence .
Preamble
import Mathlib
Formal statement
namespace AlfutovaUstinov theorem problem_4_123 (n : ℕ) (hn : ¬ 17 ∣ n) : 17 ∣ n ^ 8 + 1 ∨ 17 ∣ n ^ 8 - 1 := 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.123. Problem text and answer as catalogued on problems.ru, problem 60749: https://problems.ru/view_problem_details_new.php?id=60749