Friday, 11 March 2016

Number Theory, Squares in mathbbZp,; for odd prime p

Let p be an odd prime and gcd(n,p)=1. Assume that n=pa11pa22...pakk is the prime factorization of n. Prove
(np)=(p1p)i1(p2p)i2...(pkp)ik, where ij=1 if aj is odd, and ij=0 if aj is even.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...