Sample Exam 1 Solutions - Mathematical Reasoning | MATH 310, Exams of Mathematics

Material Type: Exam; Professor: Loveless; Class: MATH REASONING; Subject: Mathematics; University: University of Washington - Seattle; Term: Spring 2007;

Typology: Exams

Pre 2010

Uploaded on 03/11/2009

koofers-user-8uw
koofers-user-8uw 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MATH 310C
SPRING 2007
SAMPLE EXAM I SOLUTIONS
1. (a) Choose x(AC)B. Then xACbut x /B. Since xAC,xAor
xC. If xA, then we have that xAbut x /B, which means that xAB,
which is a subset of (AB)C. If x /A, then xmust be in C, which means that
x(AB)C. Thus, every element of (AC)Bis also in (AB)C, which
means that (AC)B(AB)C.
(b) As long as BCis non-empty, equality will not hold. One example is A={1,2,3},
B={1,2}, and C={2,3,4}. Then, (AC)B={3,4}but (AB)C={2,3,4}.
2. (a) The negation is: There exists an xRsuch that, for all yR,x+y /Z.
(b) The negation is: For all xZ, there exists yZsuch that x > y and x2
y/N.
3. By hypothesis, ais divisible by 3. Suppose that a+bis also divisible by 3. Then a+b= 3k
for some integer kand a= 3k0for some integer k0. So, 3k=a+b= 3k0+b, which implies
that b= 3(kk0). The integers are closed under subtraction, which means that kk0is also
an integer. Thus, bis divisible by 3. We’ve shown that, if a+bis divisible by 3, then bmust
also be divisible by 3. Thus, the contrapositive is true: if bis not divisible by 3, then a+b
is not divisible by 3.
4. Base case: If n= 1, then (1 + x)n= 1 + xand 1 + 1 ·x= 1 + xand thus the conclusion is
true.
Induction step: Suppose that (1 +x)k1 + kx for some natural number k. We want to show
that (1+ x)k+1 1 +(k+1)x. We start with the left-hand side: (1+x)k+1 = (1 + x)k(1+x)
(1+kx)(1 + x), by the induction hypothesis. We now have that (1+ x)k+1 1+ kx +x+kx2,
which in turn is greater than or equal to 1 + kx +x, since kx20. Thus, (1 + x)k+1
1+(k+ 1)x, which completes the induction step.
We’ve shown that (1 + x)n1 + nx for all natural numbers n.
5. f(x) is injective: Suppose f(x1) = f(x2). Then
x1+ 1
x11=x2+ 1
x21.
If we multiply both sides by (x11)(x21) to eliminate the denominators, we get:
(x21)(x1+ 1) = (x2+ 1)(x11).
Multiply out and combine like terms to see that x1=x2.
f(x) is not onto: There is no xsuch that f(x) = 1. If such an xdid exist, then
x+ 1
x1= 1.
This would mean that x+1 = x1, which would imply that 1 = 1. This is a contradiction.
Thus, there is an element of the target, 1 R, that is not in the image of f.
Since f(x) is not onto, f(x) is not a bijection.

Partial preview of the text

Download Sample Exam 1 Solutions - Mathematical Reasoning | MATH 310 and more Exams Mathematics in PDF only on Docsity!

MATH 310C

SPRING 2007

SAMPLE EXAM I — SOLUTIONS

  1. (a) Choose x ∈ (A ∪ C) − B. Then x ∈ A ∪ C but x /∈ B. Since x ∈ A ∪ C, x ∈ A or x ∈ C. If x ∈ A, then we have that x ∈ A but x /∈ B, which means that x ∈ A − B, which is a subset of (A − B) ∪ C. If x /∈ A, then x must be in C, which means that x ∈ (A − B) ∪ C. Thus, every element of (A ∪ C) − B is also in (A − B) ∪ C, which means that (A ∪ C) − B ⊆ (A − B) ∪ C. (b) As long as B ∩ C is non-empty, equality will not hold. One example is A = { 1 , 2 , 3 }, B = { 1 , 2 }, and C = { 2 , 3 , 4 }. Then, (A ∪ C) − B = { 3 , 4 } but (A − B) ∪ C = { 2 , 3 , 4 }.
  2. (a) The negation is: There exists an x ∈ R such that, for all y ∈ R, x + y /∈ Z.

(b) The negation is: For all x ∈ Z, there exists y ∈ Z such that x > y and x

2 y ∈/^ N.

  1. By hypothesis, a is divisible by 3. Suppose that a + b is also divisible by 3. Then a + b = 3k for some integer k and a = 3k′^ for some integer k′. So, 3k = a + b = 3k′^ + b, which implies that b = 3(k − k′). The integers are closed under subtraction, which means that k − k′^ is also an integer. Thus, b is divisible by 3. We’ve shown that, if a + b is divisible by 3, then b must also be divisible by 3. Thus, the contrapositive is true: if b is not divisible by 3, then a + b is not divisible by 3.
  2. Base case: If n = 1, then (1 + x)n^ = 1 + x and 1 + 1 · x = 1 + x and thus the conclusion is true. Induction step: Suppose that (1 + x)k^ ≥ 1 + kx for some natural number k. We want to show that (1+x)k+1^ ≥ 1+(k +1)x. We start with the left-hand side: (1+x)k+1^ = (1+x)k(1+x) ≥ (1 + kx)(1 + x), by the induction hypothesis. We now have that (1 + x)k+1^ ≥ 1 + kx + x + kx^2 , which in turn is greater than or equal to 1 + kx + x, since kx^2 ≥ 0. Thus, (1 + x)k+1^ ≥ 1 + (k + 1)x, which completes the induction step. We’ve shown that (1 + x)n^ ≥ 1 + nx for all natural numbers n.
  3. f (x) is injective: Suppose f (x 1 ) = f (x 2 ). Then

x 1 + 1 x 1 − 1

x 2 + 1 x 2 − 1

If we multiply both sides by (x 1 − 1)(x 2 − 1) to eliminate the denominators, we get:

(x 2 − 1)(x 1 + 1) = (x 2 + 1)(x 1 − 1).

Multiply out and combine like terms to see that x 1 = x 2. f (x) is not onto: There is no x such that f (x) = 1. If such an x did exist, then x + 1 x − 1

This would mean that x + 1 = x − 1, which would imply that 1 = −1. This is a contradiction. Thus, there is an element of the target, 1 ∈ R, that is not in the image of f. Since f (x) is not onto, f (x) is not a bijection.