Proof that n+1, 2n+1, 3n+2 are pairwise relatively prime.
Added by Shannon L.
Step 1
Let's take n+1 and 2n+1 as an example. We want to show that their greatest common divisor (gcd) is 1. Suppose there exists a common divisor d>1 of n+1 and 2n+1. Then, we have: d | n+1 and d | 2n+1 From the first equation, we can write n+1 = kd for some integer Show more…
Show all steps
Close
Your feedback will help us improve your experience
Anna D. and 88 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
For any positive integer n, prove that the integer 8n + 3 and 5n + 2 are relatively prime?
Linda H.
Let n ≥ 2 be an integer, such that n divides (n−1)! + 1. Show that n is a prime.
Sri K.
Show that if 2n - 1 is prime, then n is prime. [Hint: Use the identity 2ab - 1 = (2a - 1) · (2a(b-1) + 2a(b-2) + ···+ 2a + 1).]
Madhur L.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD