Define primitive roots and find primitive root of 14
Answers
Answered by
0
In modular arithmetic, a branch of number theory, a number g is aprimitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. That is, for every integer a coprime to n, there is an integer k such that gk ≡ a (mod n).
Getting primitive roots of 14. For example, if n = 14 then the elements of Zn× are the congruence classes {1, 3, 5, 9, 11, 13}; there are φ(14) = 6 of them. The order of 1 is 1, the orders of 3 and 5 are 6, the orders of 9 and 11 are 3, and the order of 13 is 2. Thus, 3 and 5 are the primitive roots modulo14.
Getting primitive roots of 14. For example, if n = 14 then the elements of Zn× are the congruence classes {1, 3, 5, 9, 11, 13}; there are φ(14) = 6 of them. The order of 1 is 1, the orders of 3 and 5 are 6, the orders of 9 and 11 are 3, and the order of 13 is 2. Thus, 3 and 5 are the primitive roots modulo14.
Answered by
0
14=2×7
14=√2×√2×√7×√7
14=-2×-7
These all are the factors of 14
I dont know what is meant by primitive factors .
But according to my opinion that means prime factors so, I add my answers .
I hope it will help u.
14=√2×√2×√7×√7
14=-2×-7
These all are the factors of 14
I dont know what is meant by primitive factors .
But according to my opinion that means prime factors so, I add my answers .
I hope it will help u.
Similar questions