Prove: Suppose that a and b are natural numbers. If gcd(a,b) > 1, then b|a or b is not a prime number.
Added by James T.
Step 1
** Show more…
Show all steps
Close
Your feedback will help us improve your experience
Shaiju T and 71 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
'Suppose a,b € N. Prove: If gcd(a,b) 1, then bla or b is not prime'
Sri K.
Show that if a, b, and c are integers such that gcd(a,b) = 1 and c divides a + b, then gcd(c, a) = gcd(c, b) = 1.
Supreeta N.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD
