Find the primitive roots of G=?.(a) {2, 6, 8}(b) {2, 5, 8}(c) {3, 4, 7, 8}(d) {2, 6, 7, 8}I have been asked this question in quiz.The origin of the question is Number Theory in chapter More Number Theory of Cryptograph & Network Security

Find the primitive roots of G=?.(a) {2, 6, 8}(b) {2, 5, 8}(c) {3, 4, 7

1.	Find the primitive roots of G=?.(a) {2, 6, 8}(b) {2, 5, 8}(c) {3, 4, 7, 8}(d) {2, 6, 7, 8}I have been asked this question in quiz.The origin of the question is Number Theory in chapter More Number Theory of Cryptograph & Network Security
Answer» The correct CHOICE is (d) {2, 6, 7, 8} For explanation I would say: Number of primitive roots = F(f(11))=f((111-110)) = f(10)= f(2). f(5) = (21-20)(51-50) = 1 X 4 = 4 The primitive roots of this set {2, 6, 7, and 8}.

Discussion

No Comment Found

Related InterviewSolutions

The inverse of 37 mod 49 is –(a) 23(b) 12(c) 4(d) 6This question was addressed to me in an interview for internship.The above asked question is from Number Theory in portion More Number Theory of Cryptograph & Network Security
How many primitive roots are there for 19?(a) 4(b) 5(c) 3(d) 6I got this question in an online interview.This interesting question is from Number Theory topic in section More Number Theory of Cryptograph & Network Security
x^7 = 17 (mod 29)(a) x = 8, 9, 12, 13, 15, 24, 28 (mod 29)(b) x = 8, 10, 12, 15, 18, 26, 27 (mod 29)(c) x = 8, 10, 12, 15, 17, 24, 27 (mod 29)(d) x = 8, 9, 13, 15, 17, 24, 28 (mod 29)I have been asked this question by my college director while I was bunking the class.I would like to ask this question from Number Theory in chapter More Number Theory of Cryptograph & Network Security
How many primitive roots are there for 25?(a) 4(b) 5(c) 7(d) 8The question was posed to me during an interview.This is a very interesting question from Number Theory in division More Number Theory of Cryptograph & Network Security
Find the solution of x^2≡ 2 mod 11 has a solution.(a) True(b) FalseThe question was posed to me in semester exam.I want to ask this question from Number Theory topic in portion More Number Theory of Cryptograph & Network Security
Find a number x between 0 and 28 with x^85 congruent to 6 mod 35.(a) 6(b) 32(c) 8(d) 28The question was posed to me in a national level competition.My question is based upon Number Theory topic in section More Number Theory of Cryptograph & Network Security
7^(3+j) mod 19 =(a) 7^j mod 19(b) 1 mod 19(c) 7^3 + 7^j mod 19(d) All of the mentioned are trueI had been asked this question during a job interview.This is a very interesting question from Number Theory topic in division More Number Theory of Cryptograph & Network Security
7^3 mod 19 =(a) 18(b) 1(c) 14(d) 12The question was asked by my school teacher while I was bunking the class.This interesting question is from Number Theory topic in chapter More Number Theory of Cryptograph & Network Security
The group G = is always cyclic.(a) True(b) FalseI had been asked this question in an online quiz.Query is from Number Theory topic in division More Number Theory of Cryptograph & Network Security
n is prime if and only if n divides (2^n – 2).(a) True(b) FalseThis question was posed to me in homework.My question is based upon Number Theory topic in portion More Number Theory of Cryptograph & Network Security

Find the primitive roots of G=?.(a) {2, 6, 8}(b) {2, 5, 8}(c) {3, 4, 7, 8}(d) {2, 6, 7, 8}I have been asked this question in quiz.The origin of the question is Number Theory in chapter More Number Theory of Cryptograph & Network Security

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment