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

DOI10.1515/FORMA-2015-0018MaRDI QIDQ500025zbMATH OpenOpenAlexFDO

Authors Rafał Ziobro

Publication date 7 October 2015

Published in Formalized Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 3.0 Unported

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

zbMATH Keywords

primesfactorizationFermat

Mathematics Subject Classification ID

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

Recommendations

• A String of Pearls: Proofs of Fermat's Little Theorem
• A string of pearls: proofs of Fermat's little theorem
• scientific article; zbMATH DE number 3857199
• Unifying two proofs of Fermat's little theorem
• Polynomial dynamics and a proof of the Fermat little theorem

Cites work

• scientific article; zbMATH DE number 3141366 (Why is no real title available?)
• scientific article; zbMATH DE number 1522818 (Why is no real title available?)
• Custom automations in Mizar
• On rewriting rules in Mizar
• Semantics of MML query -- ordering
• Some remarkable identities involving numbers

Cited in

(9)

• Elementary number theory problems. XII: Primes in arithmetic progression
• Concatenation of finite sequences
• The Matiyasevich theorem. Preliminaries
• scientific article; zbMATH DE number 3857199 (Why is no real title available?)
• Unifying two proofs of Fermat's little theorem
• Some results using natural numbers
• A string of pearls: proofs of Fermat's little theorem
• Parity as a property of integers
• Prime factorization of sums and differences of two like powers

Describes a project that uses

Uses Software

• Mizar

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q500025)