Purchase Solution

Unique Factorization Prime/Co-Prime

Not what you're looking for?

Ask Custom Question

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
Solving quadratic inequalities

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

Exponential Expressions

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

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.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Multiplying Complex Numbers

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