Proof verification for proof by contrapositionprove using contraposition that if a and b are integers:...
Proof verification for proof by contraposition
prove using contraposition that if a and b are integers:
So the contrapositive:
implies that at least one of either a or b are not integers
Working from the above, I got:
If both a and b are integers, is a perfect square.
In other words:
Where k is an integer
I also realised that is an odd number so:
I ended my proof by saying that since is odd, it does not have a multiple of 2 so k will always have multiple or which means that it cannot be an integer.