noddy
Reputation
328
Top tag
Next privilege 500 Rep.
Access review queues
 Jul 2 awarded Curious Jun 12 asked Minimize Energy using Gauss-Seidel method with successive over- relaxation. Jun 3 awarded Tumbleweed Apr 11 awarded Yearling Sep 20 asked graph orientation with constraint on incoming degree Aug 21 asked Determining the general form of $10^x \bmod 210$ Apr 3 awarded Popular Question Mar 23 accepted $x^4 - y^4 = 2z^2$ has no solution Mar 22 comment $x^4 - y^4 = 2z^2$ has no solution yes they are district also Mar 22 comment $x^4 - y^4 = 2z^2$ has no solution yah x,y,z are integers Mar 22 asked $x^4 - y^4 = 2z^2$ has no solution Mar 22 awarded Editor Mar 22 revised solving $x^2 = a \pmod {2^n}$ , $n \ge 3$ added 4 characters in body Mar 22 asked solving $x^2 = a \pmod {2^n}$ , $n \ge 3$ Mar 19 awarded Nice Question Mar 19 accepted Variation of Pythagorean triplets: $x^2+y^2 = z^3$ Mar 19 comment Variation of Pythagorean triplets: $x^2+y^2 = z^3$ @ferson2020 thats correct but i would need to prove that 8^2, 64^2 ... can be expressed as a sum of 2 squares, which i think is not possible. Can you help me with that Mar 19 comment Variation of Pythagorean triplets: $x^2+y^2 = z^3$ nope it is supposed to be z^3 Mar 19 asked Variation of Pythagorean triplets: $x^2+y^2 = z^3$ Mar 18 comment For an odd prime $p$, prove that the congruence $2x^2 +1 \equiv 0\pmod p$ has a solution if and only if $p ≡ 1 \text{ or } 3\pmod 8$ infact using the technique even k*x^2+1=0(mod p) can be solved in a similar way;k would be invertible since p is a prime