Fermat's little theorem via divisibility of Newton's binomial

DOI10.1515/FORMA-2015-0018zbMath1321.11006OpenAlexW2268053682MaRDI QIDQ500025

Rafał Ziobro

Publication date: 7 October 2015

Published in: Formalized Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/forma-2015-0018

zbMATH Keywords

primesfactorizationFermat

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Congruences; primitive roots; residue systems (11A07) Factorization; primality (11A51)

Related Items (4)

Concatenation of finite sequences ⋮ Prime factorization of sums and differences of two like powers ⋮ The Matiyasevich theorem. Preliminaries ⋮ Parity as a property of integers

Uses Software

• Mizar

Cites Work

• Unnamed Item
• Unnamed Item
• On rewriting rules in Mizar
• Custom automations in Mizar
• Some remarkable identities involving numbers
• Semantics of MML Query - Ordering

This page was built for publication: Fermat's little theorem via divisibility of Newton's binomial