Let $p$ be an odd prime and $\mathrm{gcd}(n, p) = 1.$ Assume that $n = p_1^{a_1} p_2^{a_2} ... p_k ^{a_k}$ is the prime factorization of n. Prove
$$\left(\frac{n}{p}\right) = \left(\frac{p_1}{p}\right)^{i_1} \left(\frac{p_2}{p}\right)^{i_2} ... \left(\frac{p_k}{p}\right)^{i_k},$$ where $i_j = 1$ if $a_j$ is odd, and $i_j = 0$ if $a_j$ is even.
Friday, 11 March 2016
Number Theory, Squares in $mathbb{Z}_p ^*,;$ for odd prime $p$
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
I'm just learning how to test series for convergence and have encountered this series from the Demidovich's book and I can't rea...
-
Ok, according to some notes I have, the following is true for a random variable $X$ that can only take on positive values, i.e $P(X $\int_0^...
-
Make a bijection that shows $|\mathbb C| = |\mathbb R| $ First I thought of dividing the complex numbers in the real parts and the c...
No comments:
Post a Comment