Ask a New Question

Asked by Anonymous

Prove that for all integers a, b, n: if n = a + b, then a < n/2 or b < n/2 .
I WANT TO TRY AND USE PROOF BY CONTRAPOSITIVE.

I KNOW THAT WE SHOULD ASSUME THAT IF NOT (a < n/2 or b < n/2) THEN ~(n = a + b) SHOULD BE TRUE.

I WANT TO KNOW HOW TO SOLVE THIS MATHIMATICALY. THANKS.
12 years ago

Answers

Answered by Steve
n = n/2 + n/2
If both a and b >= n/2, then
a+b >= n/2 + n/2 = n

Can you see the typo which makes the problem false as stated? Hint: 8=4+4
12 years ago

Related Questions

For all integers n ≄ 1, prove the following statement using mathematical induction. 1+2^1 +2^2 +...+... Prove that for all integers n > or = 1 and all real numbers x subscript 1, x subscript 2,...., x sub... -3,2,7,|-10| Are this integers list from least to greatest?? Prove that for all integers a, b, c , if a | c and b | c , then ab | c² Let a, b and c integers. Prove or disprove the next statements: a.7|š‘Ž^7āˆ’š‘Ž b.If 7|š‘Ž2+š‘2 then 7|š‘Ž a... Let a, b and c integers. Prove or disprove the next statements: a.7|š‘Ž^7āˆ’š‘Ž ; b. If 7|š‘Ž2+š‘2 then 7|š‘Ž a... We use the integers , , and to create the following series: You are given queries in the form... Which set of integers are in the right order from least to greatest? (1 point) Responses –8, 8, 6, |... The sum of three integers is 42. Find the product of the three numbers
Ask a New Question
Archives Contact Us Privacy Policy Terms of Use