noddy

less info
stack exchange network profile network profile
163 reputation
6
bio website
location
age
visits member for 7 months
seen Apr 19 at 1:57
stats profile views 23

32 Actions

suggestions reviews revisions comments badges posts accepts all
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 Pythagorean triplets $x^2+y^2 = z^3$
Mar
19
 comment 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 Pythagorean triplets $x^2+y^2 = z^3$
nope it is supposed to be z^3
Mar
19
 asked 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
Mar
18
 accepted 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$
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$
yah..had initially missed the inverse part..Thanks
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$
The first part is what I wanted to know how is 2x^2+1=0(mod p) same as x^2 = -2 (mod p)
Mar
18
 asked 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$
Mar
18
 accepted sum of the product of consecutive legendre symbols is -1
Mar
18
 asked sum of the product of consecutive legendre symbols is -1
1 2