#For every integer m such that 2 | m and 4 ∤ m, there exist no integers x and y for which x²+3y²= m.

8 messages · Page 1 of 1 (latest)

short ivyBOT
dawn dock
#

i got something using your path and the parity of numbers. I don't find a quicker way to solve it.

#

||forall m in M , exists k in N sa, m = 2(2k+1)||

#

if you want a small int

noble moon
#

OK. But is my quantifying statement correct?

#

Or my assumption for proof by contradiction?

#

@dawn dock

dawn dock