Question

Let n be a positive odd integer, prove gcd(3n, 3n+16) = 1.

Let n be a positive odd integer, prove gcd(3n, 3n+16) = 1.

Math   Algebra   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

since n is odd so all factors of 3n are odd

but 16 is an even no. whose only prime factor is 2

let a be a common factor to both 3n and 3n+16

since a is one of the factor of 3n so , a divides 3n

or ,3n=ak for some integer k

also 3n+16 is divisible by a so ,

3n+16=am for some integer m

now,3(ak)+16=am

or,16=a(m-3k)

this implies 16 is divisible by a

but a is an odd number

so ,here is the contradiction

therefore 3n and 3n+16 has no common factor

i.e. gcd(3n,3n+16)=1

PLEASE LIKE IT RAISE YOUR THUMBS UP

IF YOU ARE HAVING ANY DOUBT FEEL FREE TO ASK IN COMMENT SECTION

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
(a) Let N be an even integer, prove that GCD (N + 2, N) = 2....
(a) Let N be an even integer, prove that GCD (N + 2, N) = 2. (b) What’s the GCD (N + 2, N) if N is an odd integer?
Use Mathematical Induction to prove that for any odd integer n >= 1, 4 divides 3n+1.
Use Mathematical Induction to prove that for any odd integer n >= 1, 4 divides 3n+1.
6. Consider the statment. Let n be an integer. n is odd if and only if...
6. Consider the statment. Let n be an integer. n is odd if and only if 5n + 7 is even. (a) Prove the forward implication of this statement. (b) Prove the backwards implication of this statement. 7. Prove the following statement. Let a,b, and c be integers. If a divides bc and gcd(a,b) = 1, then a divides c.
Let n be an odd integer. Prove that 5460 | n25 −n
Let n be an odd integer. Prove that 5460 | n25 −n
let n be an odd integer ,prove that 5460 | n^25-n
let n be an odd integer ,prove that 5460 | n^25-n
3.a) Let n be an integer. Prove that if n is odd, then (n^2) is also...
3.a) Let n be an integer. Prove that if n is odd, then (n^2) is also odd. 3.b) Let x and y be integers. Prove that if x is even and y is divisible by 3, then the product xy is divisible by 6. 3.c) Let a and b be real numbers. Prove that if 0 < b < a, then (a^2) − ab > 0.
Prove that if n is a positive integer greater than 1, then n! + 1 is...
Prove that if n is a positive integer greater than 1, then n! + 1 is odd Prove that if a, b, c are integers such that a2 + b2 = c2, then at least one of a, b, or c is even.
Let p be an odd prime and let a be an odd integer with p not...
Let p be an odd prime and let a be an odd integer with p not divisible by a. Suppose that p = 4a + n2 for some integer n. Prove that the Legendre symbol (a/p) equals 1.
Let n be an integer greater than 2. Prove that every subgroup of Dn with odd...
Let n be an integer greater than 2. Prove that every subgroup of Dn with odd order is cyclic.
Let |a| = n. Prove that <a^i> = <a^j> if and only if gcd(n,i) = gcd...
Let |a| = n. Prove that <a^i> = <a^j> if and only if gcd(n,i) = gcd (n,j) and |a^i| = |a^j| if and only if gcd(n,i) = gcd(n,j).
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT