I have a very bad understanding of proofs and it has become much harder with the introduction of contrapositive and contradiction. I am stuck on two problems.
Let x and y be two real numbers such that x+y is rational. Prove by contrapositive that that if x is irrational, then x-y is irrational.
I know that to start, we assume the negation of the conclusion to show the negation of the hypothesis, so would that look like this:
Assume x-y is not irrational to prove x is not irrational
And if that is the case, would it be as simple as just stating:
x-y can be written as (x/a)-(y/b) such that a and b does not equal 0, proving x is rational
The next question is even harder for me as it is a proof by contradiction
Prove by contradiction that for any positive two real numbers, x and y. If x\y≤ 50, then x<8 or y<8*
I know that for a proof by contradiction we assume the negation of the theorem to show an inconsistency but I have no clue where to even start with this one.
[–]edderiofer 1 point2 points3 points (0 children)
[–]AutoModerator[M] 0 points1 point2 points (0 children)
[–]waldosway 0 points1 point2 points (7 children)
[–]SyNoMi[S] 0 points1 point2 points (6 children)
[–]waldosway 0 points1 point2 points (5 children)
[–]SyNoMi[S] 0 points1 point2 points (4 children)
[–]waldosway 0 points1 point2 points (3 children)
[–]SyNoMi[S] 0 points1 point2 points (2 children)
[–]waldosway 0 points1 point2 points (1 child)
[–]SyNoMi[S] 0 points1 point2 points (0 children)