A. Taylor Polynomial
B. Remainder
C. Simple Sum
D. None
View AnswerA. Taylor Polynomial
Modern Computer Algebra MCQs
aΦ(h1)≡ 1 (mod m) is called:
A. Euclid Theorem
B. Fermit Theorem
C. Euler’s Theorem
D. Hensel Lemma
View AnswerC. Euler’s Theorem
Other name of G.C.D algorithm is:
A. Division Algorithm
B. Euclid Algorithm
C. Addition algorithm
D. None
View AnswerB. Euclid Algorithm
A number P>1 is prime iff:
A. P! ≡ -1 (mod p)
B. (P – 2)! ≡ 2 (mod p)
C. (P-1)! ≡ 0 (mod p)
D. (P-1)! ≡ -1 (mod p)
View AnswerD. (P-1)! ≡ -1 (mod p)