Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Fermat’s Little Theorem via Divisibility of Newton’s Binomial

100%

Ziobro R.

Formalized Mathematics

2015

tom 23

nr 3

215-229

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].

Ograniczanie wyników

1 Formalized Mathematics

1 Ziobro R.

1 2015

Wyniki wyszukiwania

Fermat’s Little Theorem via Divisibility of Newton’s Binomial