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
Let a be an integer number. Suppose a % 2=1. Find all possible values of 4a+1...
Let a be an integer number. Suppose a % 2=1. Find all possible values of 4a+1 % 6.
1. Write gcd(672, 184) as an integer linear combination of 672 and 184. Show all steps...
1. Write gcd(672, 184) as an integer linear combination of 672 and 184. Show all steps 2. Find integers x, y such that 672x + 184y = 72. [Hint: use your answer to Problem 1.] Use the Euclidean Algorithm to find gcd(672, 184). Show all steps
(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.
Write (and test) a Python function that rearranges a sequence of integer values so that all...
Write (and test) a Python function that rearranges a sequence of integer values so that all the even values appear before all the odd values. Make sure to test all common use-cases (ie, an array with all even numbers, one with all odd numbers, and one with a mixture of odd and even numbers). What is the running time of your algorithm? Justify your answer. just not the solution, also need to understand it. Thanks
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.
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
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT