fmat
Reputation
Next privilege 250 Rep.
 Jul2 awarded Curious Nov30 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)}$? Nov28 asked Integer Part and Arithmetic Progressions Nov28 accepted Integer solutions for $x^2-y^3 = 23$. Nov26 asked Infinitely many odd and even integers in a sequence. Nov26 asked Integer solutions for $x^2-y^3 = 23$. Nov15 accepted The set $A = \{a^2 + 2b^2\mid a,b \in \Bbb Z\setminus\{0\}\}$ Nov14 accepted For any odd integer $x,y$, $(x^2+2) \nmid (y^2+4)$ Nov14 accepted There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it. Nov13 asked For any odd integer $x,y$, $(x^2+2) \nmid (y^2+4)$ Nov12 accepted Possible primes $p$ $q$ satisfying $a^{3pq}-a \equiv 0 \pmod {3pq}$ Nov12 accepted Let $a,b \in \Bbb Z$, $p$ a prime and $p \gt 2$, given the following Nov12 accepted $x^2 \equiv 2x \pmod m$ Nov12 accepted There exists finitely many numbers s.t.: “the number of digits = total number of its prime divisor” Nov12 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 Nov12 comment There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it. "FOR ALL" prime $p$ Nov12 asked There exists finitely many numbers s.t.: “the number of digits = total number of its prime divisor” Nov12 asked There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it. Nov5 accepted Let $a_n = n^n$. For all $n \in \Bbb N$, show that Nov2 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?