Reputation
7,481
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
8 24
Newest
 Necromancer
Impact
~62k people reached

Apr
21
comment Explicit Galois Action for $X^3 - X -1$
This is not very explicit at all. Is there a rational substitution $x \mapsto \frac{p(x)}{q(x)}$ such that $x \leftrightarrow z$ ?
Apr
21
asked Explicit Galois Action for $X^3 - X -1$
Apr
20
comment Prove that $\mathcal{O}_3$ and $\mathcal{O}_7$ are euclidean domains
See also: Keith Conrad Euclidean Domains
Apr
20
revised Prove that $\mathcal{O}_3$ and $\mathcal{O}_7$ are euclidean domains
erroneous figure replaced
Apr
20
answered Prove that $\mathcal{O}_3$ and $\mathcal{O}_7$ are euclidean domains
Apr
14
comment What is $\left[\frac{1}{2}(p-1)\right]! \;(\text{mod } p)$ for $p = 4k+1$?
@nayrb A similar statement is Gauss' Lemma in Number Theory which counts the number of residues of $\{ a, 2a, \dots, \tfrac{p-1}{2} a\}$ less than $p/2$.
Apr
14
comment What is $\left[\frac{1}{2}(p-1)\right]! \;(\text{mod } p)$ for $p = 4k+1$?
@nayrb the original theorem just asks about whether $\nu$ is even or odd. that might be good enough.
Apr
14
revised What is $\left[\frac{1}{2}(p-1)\right]! \;(\text{mod } p)$ for $p = 4k+1$?
added 218 characters in body
Apr
14
revised What is $\left[\frac{1}{2}(p-1)\right]! \;(\text{mod } p)$ for $p = 4k+1$?
deleted 26 characters in body; edited title
Apr
14
comment What is $\left[\frac{1}{2}(p-1)\right]! \;(\text{mod } p)$ for $p = 4k+1$?
whoops :-) my 2nd question would be nontrivial if I said "less than $\frac{p}{4}$"
Apr
14
asked What is $\left[\frac{1}{2}(p-1)\right]! \;(\text{mod } p)$ for $p = 4k+1$?
Apr
14
asked Continued fraction for $[1,2,3,4,5,6,\dots]$
Apr
13
awarded  Necromancer
Apr
8
revised How to prove Chebyshev's result: $\sum_{p\leq n} \frac{\log p}{p} \sim\log n $ as $n\to\infty$?
defective link
Apr
8
comment Fundamental unit in the ring of integers $\mathbb Z[\frac{1+\sqrt{141}}{2}]$
Another version of this discussion appears in Section 2.7 of Borevich + Shafarevich number theory book (PDF) in the Chapter on "Decomposable Forms", meaning that $x^2 - dy^2 = (x - \sqrt{d} y)(x + \sqrt{d}y)$ has complete factorization. Pell's equation can be thought of as a special case of Dirichlet Unit Theorem in Section 2.4 or part of Quadratic Forms in Section 2.7
Apr
8
comment How find the postive $m,n$,such $a^n\equiv 1\pmod m$
Consider mod 8. $\phi(8) = 4$ so $a^4 \equiv 1 \mod 8$ whenever $(a,8)=1$ - in fact $a^2 \equiv 1 \mod 8$. The group structure of $\mathbb{Z}/m\mathbb{Z}$ is tied to the prime factorization of the units $\phi(m)$, which depends on the prime factorization of $m$.
Apr
7
comment Fundamental unit in the ring of integers $\mathbb Z[\frac{1+\sqrt{141}}{2}]$
The Pigeonhole Principle and this solution of Pell's equation is due to Dirichlet
Apr
7
revised Fundamental unit in the ring of integers $\mathbb Z[\frac{1+\sqrt{141}}{2}]$
added 827 characters in body
Apr
7
answered Fundamental unit in the ring of integers $\mathbb Z[\frac{1+\sqrt{141}}{2}]$
Apr
7
comment Fundamental unit in the ring of integers $\mathbb Z[\frac{1+\sqrt{141}}{2}]$
math.uzh.ch/index.php?file&key1=31685