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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. 11^7 mod 13 =

View solution

Q. The multiplicative Inverse of 1234 mod 4321 is

View solution

Q. The multiplicative Inverse of 550 mod 1769 is

View solution

Q. The multiplicative Inverse of 24140 mod 40902 is

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Multiplication / Division follow which operation?

View solution

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?

View solution