hw2math109

# hw2math109 - MATH 109 Due Assignment 2#4.2 Proof We are...

This preview shows pages 1–2. Sign up to view the full content.

MATH 109 Assignment 2 Due: 4/11/11 #4.2 Proof. We are given that n is odd, and we suppose for a contradiction that n 2 is not odd. By deﬁnition, this implies that 2 6 | n and 2 | n 2 . Let x Z be the integer such that 2 x = n 2 . Observe that ( n + 2) 2 = n 2 + 4 n + 4 = 2 x + 4 n + 4 = 2( x + 2 n + 2) so ( n + 2) 2 is even. By Part I Problem #7, we have that n + 2 must be even so let y Z be the integer such that 2 y = n + 2. Since n = ( n + 2) - 2 = 2 y - 2 = 2( y - 1) , we get a contradiction to the fact that n is odd. Hence, n 2 must be odd. #4.7 Proof. By Axiom 3.1.2 (ii), we can add the inequalities -| a | ≤ a ≤ | a | and -| b | ≤ b ≤ | b | to obtain - ( | a | + | b | ) a + b ≤ | a | + | b | , and hence we conclude that | a + b | ≤ | a | + | b | . A necessary and suﬃcient condition for equality is that either (i) ( a = 0 or b = 0) or (ii) a = cb for some positive c R .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 08/02/2011 for the course MATH 109 taught by Professor Knutson during the Spring '06 term at UCSD.

### Page1 / 2

hw2math109 - MATH 109 Due Assignment 2#4.2 Proof We are...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online