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}...
-
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}...
-
$$ 3x+6y+5z=7 $$ The general solution to this linear Diophantine equation is as described here (Page 7-8) is: $$ x = 5k+2l+14 $$ $$ y = -l $...
-
How can one proof the equality $$\sum\limits_{v=0}^k \frac{k^v}{v!}=\sum\limits_{v=0}^k \frac{v^v (k-v)^{k-v}}{v!(k-v)!}$$ for $k\in\mathbb{...
No comments:
Post a Comment