This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Name: Math 109 Midterm Exam 1 April 27, 2007 PID: Turn oﬀ and put away your cell phone. No calculators or any other electronic devices are allowed during this exam. You may use one page of notes, but no books or other assistance on this exam. Read each question carefully, answer each question completely, and show all of your work. Write your solutions clearly and legibly; no credit will be given for illegible solutions. If any question is not clear, ask for clariﬁcation. # 1 2 3 4 5 Σ Points 6 6 6 6 6 30 Score 1. (6 points) Let D be a division ring. Consider the following statement: • D is a ﬁeld is a necessary condition for D to be ﬁnite. For purposes of this question, it is not necessary to know what “division ring”, “ﬁeld”, or “ﬁnite” mean. (a) Write the contrapositive of the statement. (b) Write the converse of the statement. (c) Write the negation of the statement. 2. (6 points) Consider the following proof that 1 is the smallest positive real number.
Let x be the smallest positive real number. Clearly, x ≤ 1. On the other hand, x2 ≤ x. Thus, x(x − 1) = x2 − x ≥ 0. Therefore, x ≥ 1 and it follows that x = 1. (a) What is wrong with the proof? (b) What correct statement does this proof actually prove? What type of proof is it? 3. (6 points) Recall the following deﬁnitions for any sets P , Q, R and S : (i) x ∈ P ∩ Q if and only if x ∈ P and x ∈ Q. (ii) (x, y ) ∈ S × T if and only if x ∈ S and y ∈ T . Let A, B and C be sets. Prove directly using the above deﬁnitions that A × (B ∩ C ) = (A × B ) ∩ (A × C ) . (Note: neither a truth table nor a Venn diagram meets the requirements of this problem and so will not earn any credit.) 4. (6 points) Prove by induction that for every positive integer n,
n 3k 2 − 3k + 1 = n3 .
k =1 5. (6 points) Suppose that f : X → Y g ◦ f : X → Z is an injection. and g : Y → Z are injections. Prove that ...
View Full
Document
 Spring '09
 BUEHLER

Click to edit the document details