Prime proofs
Not what you're looking for?
1. If and are distinct primes prove that for any integer a,
Use Fermat's theorem
2. Show that if and are both primes, then 4[ (mod
Use Wilson's theorem.
3. Let be an odd prime. Prove that if g is primitive root modulo and (mod is not
Use the binomial expansion
See attached file for full problem description.
Purchase this Solution
Solution Summary
There are three proofs here that use Fermat's theorem, Wilson's theorem, and binomial expansion.
Solution Preview
Please see the attached file.
1. Proof:
Since and are distinct primes, then . According to Fermat's Theorem, for any integer , we have (mod ) and (mod ).
Now we check the expression .
Since (mod ) and (mod ), then we have and . Thus .
Similarly, (mod ) and (mod ), then ...
Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Probability Quiz
Some questions on probability
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.