Euler's theorem and ferma's theorem, discrete logarithm's Theorem

Source: Internet
Author: User

Ferma's TheoremIs a theorem in number theory:

Assume thatAIs an integer,PIs a prime number, so it is a multiple of P, which can be expressed

IfANoPThis theorem can also be written as a multiple

This writing method is more commonly used.

Euler's Theorem(Also calledFerma-Euler's TheoremOrEuler's Function Theorem) Is the same as the remainder. Euler's theorem indicates that, if it is a positive integer and is a reciprocal (I .e.),

That is, it is the same as 1 in the modulo n; PHI (n) is the Euler's function. The Euler's theorem is named after the Swiss mathematician Leon had Euler.

If P is a prime number


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.