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

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

View solution

Q. If f(x)=x^3+x^2+2 and g(x)=x^2-x+1, find: f(x) + g(x)

View solution

Q. Find the 8-bit word related to the polynomial x^5 + x^2 + x

View solution

Q. Find the 8-bit word related to the polynomial x^6 + x^5 + x^2 + x +1

View solution

Q. Primitive Polynomial is also called a ____

i) Perfect Polynomial
ii) Prime Polynomial
iii) Irreducible Polynomial
iv) Imperfect Polynomial

View solution

Q. Which of the following are irreducible polynomials?

i) X^4+X^3
ii) 1
iii) X^2+1
iv) X^4+X+1

View solution

Q. The polynomial f(x)=x^3+x+1 is a reducible.

View solution

Q. 5/3 mod 7 =

View solution

Q. -5 mod -3 =

View solution

Q. Multiply 00100110 by 10011110 in GF(2^8) with modulus 100011011.The result is

View solution