Question

State all the possible values for gcd(m,m+6) where m is an integer.

State all the possible values for gcd(m,m+6) where m is an integer.

Homework Answers

Answer #1

Let

d=gcd(m,m+6)

d/m and d/(m+6).

d/((m+6)-m)

d/6 ........(1)

So the positive numbers dividing 6 are 1,2,3,6

(When we talk about GCD,then it is obvious that we are talking about positive integers.)

Now taking m=1 then m+6=7

Then gcd(1,7) =1

So 1 is the possible case for gcd(m,m+6)

Also taking m=2 then ,m+6=8

Then gcd(2,8)=2.

Hence 2 is also possible case for gcd(m,m+6).

Now take m=3,then m+6=9,then

gcd(3,9)=3

So 3 is also possible case for gcd(m,m+6).

Taking m=6,then m+6=12

Then gcd(6,12)=6.

Hence 6 is also possible case for gcd(m,m+6).

Also from equation(1),gcd(m,m+6) can't be greater than 6.

Hence possible values for gcd(m,m+6) are 1,2,3 & 6.

Hence the solution.

Please leave a feedback.?

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
(a) Show that if gcd(a, m) > 1 that there exists [b] 6= [0] with [a][b]...
(a) Show that if gcd(a, m) > 1 that there exists [b] 6= [0] with [a][b] = [0] (we say that [a] is a zero divisor ). (b) Use this to show that if gcd(a, m) > 1 then [a]m is not a unit.
Let a be an element of order n in a group and d = gcd(n,k) where...
Let a be an element of order n in a group and d = gcd(n,k) where k is a positive integer. a) Prove that <a^k> = <a^d> b) Prove that |a^k| = n/d c) Use the parts you proved above to find all the cyclic subgroups and their orders when |a| = 100.
Suppose that M is an n×n matrix of finite order. Find all possible values for det(M).
Suppose that M is an n×n matrix of finite order. Find all possible values for det(M).
prove that for every integer m, the number (m^3 +3m^2 +2m)/6 is also an integer can...
prove that for every integer m, the number (m^3 +3m^2 +2m)/6 is also an integer can I get a step by step induction proof please.
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.
Discrete Math 6. Prove that for all positive integer n, there exists an even positive integer...
Discrete Math 6. Prove that for all positive integer n, there exists an even positive integer k such that n < k + 3 ≤ n + 2 . (You can use that facts without proof that even plus even is even or/and even plus odd is odd.)
Write a statement which assigns all the odd integer values between 0 and 10 (in order)...
Write a statement which assigns all the odd integer values between 0 and 10 (in order) to the variable named odds. Python Language
Find the absolute extrema if they​ exist, as well as all values of x where they​...
Find the absolute extrema if they​ exist, as well as all values of x where they​ occur, for the function: f(x) = 2x^4 - 100x^2 - 5 ; on the domain [ -6 , 6 ]
Calculate all possible values (3 - 2i)1/5
Calculate all possible values (3 - 2i)1/5
Suppose we already proved the correctness of the RSA algorithm under the assumption that gcd(m, n)...
Suppose we already proved the correctness of the RSA algorithm under the assumption that gcd(m, n) = 1. Prove the correctness of the RSA algorithm without this assumption, that is, m^de ≡ m (mod n) for all 1 ≤ m < n. (Hint: use the Chinese remainder theorem.)