Purchase Solution

# Fermat's Little theorem

Not what you're looking for?

Please DO NOT USE Euler's function. You can only use Fermat's Little theorem if needed.

Problem:

Prove that if p is prime and (a,p)=1 , then the congruence ax = b (mod p) has the solution

x = a^(p-2) b (mod p)

Thank you!

##### Solution Summary

This solution shows all the steps to solve the given problem using Fermat's little theorem.

##### Solution Preview

Proof:
According to Fermat's Little theorem, if p is a prime ...

##### Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts