I just stumbled on a nice little proof I'd forgotten about:
Show that \( ax^2 + bx + c =0 \) has no rational solutions if \(a\), \(b\) and \(c\) are all odd.
If \( ax^2 + bx + c =0 \) has rational solutions, it can be written as \((px+q)(rx+s)\), with \(p\),\(q\),\(r\) and \(s\) integer.
\( a= pr\) and is odd, so \(p\) and \(r\) are both odd.
Similarly, \( c = qs\) and is odd, so \(q\) and \(s\) are both odd.
\( b \) is odd, but must equal \( ps+qr\), which is even. Contradiction.
@icecolbeveridge (hope my first tray at a content warning works). Here's mine
Any odd square is 1 mod 8, but \(b^2-4ac\) is 5 mod 8.
Your proof relates to the method of factorising that starts "find two integers whose sum is \(b\) and whose product is \(ac\)". Mine uses the quadratic formula. Now we want one that relates to completing the square.
@jimsimons I think the formula is completing the square in glasses and a fake moustache ;-)
Multiply it all by \( 4a\):
Complete the square:
... and that only works if \(b^2 - 4ac \) is square -- and by your argument, it isn't.
along the lines of the √2 proof:
Suppose p/q is a reduced rational solution. Then clearing denominators, 𝑎𝑝²+𝑏𝑝𝑞+𝑐𝑞²=0. If exactly one of 𝑝,𝑞 are even, then this is two even terms and an odd one. If neither of them is even, then it's three odd terms. So they're both even, contradicting "reduced" fraction.
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!