|
|
comment |
Integer Part and Arithmetic Progressions
|
|
|
asked |
Integer Part and Arithmetic Progressions |
|
|
accepted |
Integer solutions for $x^2-y^3 = 23$. |
|
|
asked |
Infinitely many odd and even integers in a sequence. |
|
|
asked |
Integer solutions for $x^2-y^3 = 23$. |
|
|
accepted |
The set $A = \{a^2 + 2b^2\mid a,b \in \Bbb Z\setminus\{0\}\}$ |
|
|
accepted |
For any odd integer $x,y$, $(x^2+2) \nmid (y^2+4)$ |
|
|
accepted |
There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it. |
|
|
asked |
For any odd integer $x,y$, $(x^2+2) \nmid (y^2+4)$ |
|
|
accepted |
Possible primes $p$ $q$ satisfying $a^{3pq}-a \equiv 0 \pmod {3pq}$ |
|
|
accepted |
Let $a,b \in \Bbb Z$, $p$ a prime and $p \gt 2$, given the following |
|
|
accepted |
$x^2 \equiv 2x \pmod m$ |
|
|
accepted |
There exists finitely many numbers s.t.: “the number of digits = total number of its prime divisor” |
|
|
revised |
There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it.
|
|
|
comment |
There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it.
|
|
|
asked |
There exists finitely many numbers s.t.: “the number of digits = total number of its prime divisor” |
|
|
asked |
There is solution for $x^{16} \equiv 256 \pmod p$ for all prime $p$. Prove or disprove it. |
|
|
accepted |
Let $a_n = n^n$. For all $n \in \Bbb N$, show that |
|
|
comment |
Let $a_n = n^n$. For all $n \in \Bbb N$, show that
|
|
|
asked |
Let $a_n = n^n$. For all $n \in \Bbb N$, show that |
meta user
network profile
