Demoivre’s Theorem is used to fine the roots of a | an : A. Real number B. Complex number C. Algebraic equation D. All View Answer B. Complex number Related MCQs A number P>1 is prime iff: Other name of G.C.D algorithm is: aΦ(h1)≡ 1 (mod m) is called: A partial sum of Taylor’s series is called: G.C.D of 6 and 0 is : The square of an odd integer is of the form: A process to solve system of congurences is called: Numbers having G.C.D. one are called: In division algorithm, f(x) = (x-a) q(x)+R here x-a is: The degree of a Quadratic equation cannot exceed than:
