172 reputation
6
bio website
location
age
visits member for 2 years, 2 months
seen Dec 14 '12 at 9:54

Jul
2
awarded  Curious
Nov
30
comment Integer Part and Arithmetic Progressions
Good, but I was wondering should it be $0<\alpha-\frac d{n_1-n_0}<\frac{1+a-n_0\alpha} {k(n_1-n_0)}$?
Nov
28
asked Integer Part and Arithmetic Progressions
Nov
28
accepted Integer solutions for $x^2-y^3 = 23$.
Nov
26
asked Infinitely many odd and even integers in a sequence.
Nov
26
asked Integer solutions for $x^2-y^3 = 23$.
Nov
15
accepted The set $A = \{a^2 + 2b^2\mid a,b \in \Bbb Z\setminus\{0\}\}$
Nov
14
accepted For any odd integer $x,y$, $(x^2+2) \nmid (y^2+4)$
Nov
14
accepted There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it.
Nov
13
asked For any odd integer $x,y$, $(x^2+2) \nmid (y^2+4)$
Nov
12
accepted Possible primes $p$ $q$ satisfying $a^{3pq}-a \equiv 0 \pmod {3pq}$
Nov
12
accepted Let $a,b \in \Bbb Z$, $p$ a prime and $p \gt 2$, given the following
Nov
12
accepted $x^2 \equiv 2x \pmod m$
Nov
12
accepted There exists finitely many numbers s.t.: “the number of digits = total number of its prime divisor”
Nov
12
revised There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it.
added 151 characters in body; edited title
Nov
12
comment There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it.
"FOR ALL" prime $p$
Nov
12
asked There exists finitely many numbers s.t.: “the number of digits = total number of its prime divisor”
Nov
12
asked There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it.
Nov
5
accepted Let $a_n = n^n$. For all $n \in \Bbb N$, show that
Nov
2
comment Let $a_n = n^n$. For all $n \in \Bbb N$, show that
Good, may I ask you what does $\underset{p | m}{\mathrm{ppcm}} \{ p(p-1) \}$ mean here? Is it some sort of notation?