Question

Prove: For all positive integers n, the numbers 7n+ 5 and 7n+ 12 are relatively prime.

Prove: For all positive integers n, the numbers 7n+ 5 and 7n+ 12 are relatively prime.

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

bezout's theorem  :- two integer a and b are coprime if their exist integer u and v such that au+bv=1

let b = 7n+5 , a = 7n+12

(7n+12)=(7n+5)+7

(7n+5)= n(7)+5

7= 1(5)+2

5=2(2)+1

we now just go back

1=5-2(2)

= 5-2(7-1(5))

= 5-2(7)+2(5)

= -2(7)+3(5)

= -2(7)+3((7n+5)-n(7))

= -2(7)+3(7n+5)-3n(7)

= -(2+3n)(7)+3(7n+5)

= -(2+3n)((7n+12)-(7n+5))+3(7n+5)

= -(2+3n)(7n+12)+(2+3n)(7n+5)+3(7n+5)

= -(2+3n)(7n+12)+(5+3n)(7n+5)

therefore -(2+3n)(7n+12)+(5+3n)(7n+5)=1

u = -(2+3n) v= (5+3n)

since n is integer therefore u and v are integers by above theorem we can conclude that 7n+12 and 7n+5 are relatively prime.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n...
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n > 1.
Prove the following statements: 1- If m and n are relatively prime, then for any x...
Prove the following statements: 1- If m and n are relatively prime, then for any x belongs, Z there are integers a; b such that x = am + bn 2- For every n belongs N, the number (n^3 + 2) is not divisible by 4.
Two numbers are relatively prime if their greatest common divisor is 1. Show that if a...
Two numbers are relatively prime if their greatest common divisor is 1. Show that if a and b are relatively prime, then there exist integers m and n such that am+bn = 1. (proof by induction preferred)
Using induction prove that for all positive integers n, n^2−n is even.
Using induction prove that for all positive integers n, n^2−n is even.
(10) Use mathematical induction to prove that 7n – 2n  is divisible by 5 for all n...
(10) Use mathematical induction to prove that 7n – 2n  is divisible by 5 for all n >= 0.
.Prove that for all integers n > 4, if n is a perfect square, then n−1...
.Prove that for all integers n > 4, if n is a perfect square, then n−1 is not prime.
Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find...
Let phi(n) = integers from 1 to (n-1) that are relatively prime to n 1. Find phi(2^n) 2. Find phi(p^n) 3. Find phi(p•q) where p, q are distinct primes 4. Find phi(a•b) where a, b are relatively prime
Prove by induction that 5^n + 12n – 1 is divisible by 16 for all positive...
Prove by induction that 5^n + 12n – 1 is divisible by 16 for all positive integers n.
Problem 1. Prove that for all positive integers n, we have 1 + 3 + ....
Problem 1. Prove that for all positive integers n, we have 1 + 3 + . . . + (2n − 1) = n ^2 .
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT