adplus-dvertising
frame-decoration

Question

Calculate the GCD of 1160718174 and 316258250 using Euclidean algorithm.

a.

882

b.

770

c.

1078

d.

1225

Answer: (c).1078

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Calculate the GCD of 1160718174 and 316258250 using Euclidean algorithm.

Similar Questions

Discover Related MCQs

Q. Calculate the GCD of 102947526 and 239821932 using Euclidean algorithm.

Q. Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm.

Q. What is 11 mod 7 and -11 mod 7?

Q. Which of the following is a valid property for concurrency?

Q. [(a mod n) + (b mod n)] mod n = (a+b) mod n

Q. [(a mod n) – (b mod n)] mod n = (b – a) mod n

Q. 11^7 mod 13 =

Q. The multiplicative Inverse of 1234 mod 4321 is

Q. The multiplicative Inverse of 550 mod 1769 is

Q. The multiplicative Inverse of 24140 mod 40902 is

Q. GCD(a,b) = GCD(b,a mod b)

Q. In modular arithmetic : (a/b) = b(a^-1)

Q. For the group Sn of all permutations of n distinct symbols, what is the number of elements in Sn?

Q. For the group Sn of all permutations of n distinct symbols, Sn is an abelian group for all values of n.

Q. Is S a ring from the following multiplication and addition tables?

+ a b x a b
a a b a a a
b b a b a b

Q. Does the set of residue classes (mod 3) form a group with respect to modular addition?

Q. A very common field in this category is GF(2) with the set {1, 2} and two operations, addition and multiplication.”

Q. Multiplication / Division follow which operation?

Q. 0 1 2 3 4
0 4 3 2 1

0 1 2 3 4
– 1 3 2 4

What do the above numbers correspond to?

Q. How many numbers cannot be used in GF(p) in 2n where n=4?