Unique Factorization Prime/Co-Prime
Not what you're looking for?
1. Prove that a and b are coprime if and only if no prime numbers divides both a and b
2. Show that [a,m] = m if and only if a divides m
Purchase this Solution
Solution Summary
In a few paragraphs, the solution gives a detailed explanation on how to approach problems related to primes and co-primes.
Solution Preview
For question 1. Recall, two numbers are called co-prime when their greatest common divisor gcd(a,b)=1 (Some might use (a,b), it's just a matter of notation). Now let's think about this: suppose there exists a prime that divides both a and b, then p is a common divisor of a,b. ...
Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Exponential Expressions
In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.
Probability Quiz
Some questions on probability