The number is composite
ProvedAlfutovaUstinov.problem_4_119elementary-number-theoryfermat-little-theoremnumber-theoryprimality
This is Problem 4.119 of N. B. Alfutova and A. V. Ustinov, Algebra and Number Theory (MCCME, 2002), Chapter 4, §4 “Theorems of Fermat and Euler”.
Theorem. The natural number
is composite, i.e. and is not prime.
The exercise is a classical application of Fermat's little theorem to exhibit an explicit small prime factor of a huge number.
Formalization Note “Composite” is formalized as the conjunction and for the natural number (Nat.Prime).
Preamble
import Mathlib
Formal statement
namespace AlfutovaUstinov theorem problem_4_119 : 1 < 30 ^ 239 + 239 ^ 30 ∧ ¬ Nat.Prime (30 ^ 239 + 239 ^ 30) := 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.119. Problem text and answer as catalogued on problems.ru, problem 30678: https://problems.ru/view_problem_details_new.php?id=30678