Is 3 a primitive root of 7? If your answer is ‘yes’, you must show all computations that prove this result. If your answer is ‘no’, you must show sufficient computations to prove your answer.

Yes, 3 is a primitive root of 7.

Step-by-step explanation:

By definition if primitive root, b is a primitive root of p, where p is a prime, if powers of b includes all residue classes mod p. Here,

mod 7=1

mod 7=3

mod 7=2

mod 7=6

mod 7=4

mod 7=5

And =numbers less than 7 and prime to 7=1,2,3,4,5,6, presents in the residue class of 3 mod 7, this proves 3 is a primitive root of 7.

not only in mathematics, scientific proof also are required in the other field of science. also maths proofs are of particular structure, containing steps and logics. so proving is like doing science, it is science. that's why it is important to prove. 

an inaccurate proof leads to errors, or stating results that are not accurate.  which wil mess the probelm up you dont want this