Fermat’s Little Theorem

Introduction: When I was looking for a theorem proving the internal evaluation of Mathematics SL, I had no choice but to read Fermat's little theorem, which is a theorem I've never heard before. By studying and reading this theorem, interesting and true curiosity about this theorem increases. It was proposed by a French lawyer and an amateur mathematician Pierre de Fermat in the 16th century. He made an important contribution to analytical geometry, probability and optics.

Fermat's most famous discovery in number theory contains a small theorem of ubiquitous Fermat; he says Fermat's last theorem n = 4 (he may also prove n = 3) ; Theorem (any prime number (4n + 1) can be expressed by the sum of two squares) can be considered the most difficult arithmetic theorem that has been proved. It is difficult for Fermat to prove Christmas's law with "infinity drop", but the details are not recorded, so this theorem is often called the Fermat - Euler prime number theorem. Another famous speculation of evidence Fermat is that each natural number is the sum of three triangles, or more generally the sum of k k numbers. Like his "final theorem", he insists that there is evidence, but he does not write it.

Eulatientent theorem is the general form of Fermat's small theory. Therefore, as Euler showed in the study in 1763, it relied entirely on Fermat's small theorem, and in the late 1883, JJ Silvester was named after him. According to Sylvester, the theorem is basically about the change in similarity. Since the term "Totient" is derived from "Quotient", this function handles division, but it does its own way. Thus, since the number of positive integers is less than or equal to n and is common to n, it is possible to divide Euler's Totient function of arbitrary integer (n).