Fermat’s Little Theorem via Divisibility of Newton’s Binomial
Formalized Mathematics · 2015
DOI: 10.1515/forma-2015-0018 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formalized Mathematics, 2015. Verfasst von Rafał Ziobro. Die Arbeit wurde bisher 6-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-SA 3.0).
Abstract (Originalsprache)
Solving equations in integers is an important part of the number theory [29]. In many cases it can be conducted by the factorization of equation’s elements, such as the Newton’s binomial. The article introduces several simple formulas, which may facilitate this process. Some of them are taken from relevant books [28], [14]. In the second section of the article, Fermat’s Little Theorem is proved in a classical way, on the basis of divisibility of Newton’s binomial. Although slightly redundant in its content (another proof of the theorem has earlier been included in [12]), the article provides a good example, how the application of registrations could shorten the length of Mizar proofs [9], [17].
Zitieren
APA
Ziobro, R. (2015). Fermat’s Little Theorem via Divisibility of Newton’s Binomial. Formalized Mathematics. https://doi.org/10.1515/forma-2015-0018
Vancouver
Ziobro R. Fermat’s Little Theorem via Divisibility of Newton’s Binomial. Formalized Mathematics. 2015. doi:10.1515/forma-2015-0018
BibTeX
@article{Ziobro2015,
author = {Ziobro, Rafał},
title = {Fermat’s Little Theorem via Divisibility of Newton’s Binomial},
journal = {Formalized Mathematics},
year = {2015},
doi = {10.1515/forma-2015-0018}
}
EUVIMED