Math 230 Final Exam, Spring 2009

Similar documents
Math 230 Final Exam, Spring 2008

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

Math 430 Final Exam, Fall 2008

Math 430 Exam 1, Fall 2006

Math 430 Exam 2, Fall 2008

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

Problem Points Score Total 100

RYERSON UNIVERSITY DEPARTMENT OF MATHEMATICS

CS 514, Mathematics for Computer Science Mid-semester Exam, Autumn 2017 Department of Computer Science and Engineering IIT Guwahati

*EXAM 1* EECS 203 Spring 2016

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Exam in Discrete Mathematics

Discrete Mathematics Exam File Spring Exam #1

Math 10850, fall 2017, University of Notre Dame

Math 3000 Section 003 Intro to Abstract Math Final Exam

Exam in Discrete Mathematics

MATH 114 Fall 2004 Solutions to practice problems for Final Exam

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Computer Science Foundation Exam

*EXAM 1 Answer key* EECS 203 Spring 2016

Midterm 1. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Basic Proof Examples

*Final Exam* EECS 203 Spring 2015

Chapter 1 : The language of mathematics.

CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions

7.11 A proof involving composition Variation in terminology... 88

D I S C R E T E M AT H E M AT I C S H O M E W O R K

Discrete Structures: Sample Questions, Exam 2, SOLUTIONS

Discrete Structures Homework 1

Math 3000 Section 003 Intro to Abstract Math Homework 6

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

Writing Assignment 2 Student Sample Questions

Midterm Exam Solution

Math 2534 Solution to Test 3A Spring 2010

Mathematics 220 Midterm Practice problems from old exams Page 1 of 8

CSE 20 DISCRETE MATH SPRING

Review 3. Andreas Klappenecker

CSC 125 :: Final Exam December 14, 2011

Math 13, Spring 2013, Lecture B: Midterm

University of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012

Name: Exam 2 Solutions. March 13, 2017

Preparing for the CS 173 (A) Fall 2018 Midterm 1

Recitation 7: Existence Proofs and Mathematical Induction

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

A Semester Course in Basic Abstract Algebra

MATH 363: Discrete Mathematics

Answer: Answer: 37! 3 How many five card hands are there that contain at least one club? Answer: How many one pair poker hands are there? Etc.

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

CS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A

MATH 215 Final. M4. For all a, b in Z, a b = b a.

Some Review Problems for Exam 1: Solutions

Name: Mathematics 1C03

MATH 13 FINAL EXAM SOLUTIONS

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

then the hard copy will not be correct whenever your instructor modifies the assignments.

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators

CS280, Spring 2004: Prelim Solutions

Math 109 September 1, 2016

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013

*Final Exam* EECS 203 Spring 2016

Do not open this exam until you are told to begin. You will have 75 minutes for the exam.

Math 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.

ASSIGNMENT 1 SOLUTIONS

Logic. Facts (with proofs) CHAPTER 1. Definitions

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).

PROOFS IN MATHEMATICS

1. From Lewis Carroll: extract a pair of premises and finish the conclusion.

Exam Practice Problems

A Guide to Proof-Writing

Equivalence of Propositions

MATH 2200 Final LC Review

*Final Exam* EECS 203 Spring 2016

CSC 125 :: Final Exam May 3 & 5, 2010

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.

(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)

1. Propositions: Contrapositives and Converses

Foundations Revision Notes

CSE 321 Solutions to Practice Problems

MAT2345 Discrete Math

Announcements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive

CSE 311: Foundations of Computing I Autumn 2014 Practice Final: Section X. Closed book, closed notes, no cell phones, no calculators.

Winter 2014 Practice Final 3/21/14 Student ID

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

1. (B) The union of sets A and B is the set whose elements belong to at least one of A

MTH001- Elementary Mathematics Solved Final Term Papers For Final Term Exam Preparation

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

Discrete Mathematics and Probability Theory Summer 2015 Chung-Wei Lin Midterm 1

1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao

Fall 2014 CMSC250/250H Midterm II

CSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee

Welcome to MAT 137! Course website:

Do not start until you are given the green signal

MATH FINAL EXAM REVIEW HINTS

About This Document. MTH299 - Examples Weeks 1-6; updated on January 5, 2018

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

Notation Index. gcd(a, b) (greatest common divisor) NT-16

Math.3336: Discrete Mathematics. Proof Methods and Strategy

Transcription:

IIT Dept. Applied Mathematics, May 13, 2009 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2009 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part I (25 questions, 50 points). Short answer no partial credit. Suggested time 55 minutes. Part II (5 questions, 30 points). Computation, algorithms, and examples show work for full credit. Suggested time 30 minutes. Part III (4 questions, 20 points). Proofs show work for full credit. Substantial partial credit for good proof structure. Suggested time 35 minutes. Course grades posted Wednesday, May 20 on Blackboard.

IIT Dept. Applied Mathematics, May 13, 2009 2 I. Short answer (2 pts each). No partial credit only the response will be graded. Suggested time 55 minutes. 1. Compute the following: 23 mod 5 = 40 mod 7 = 2. Suppose that P (n) is the statement n + 1 = n + 2. What is wrong with the following proof that the statement P (n) is true for all nonnegative integers n: You assume that P (k) is true for some positive integer k; that is, k + 1 = k + 2. Then you add 1 to both sides of this equation to obtain k + 2 = k + 3; therefore P (k + 1) is true. By the principle of mathematical induction P (n) is true for all nonnegative integers n. (a) There is nothing wrong with this proof. (b) The proof is incorrect because the statement used in the inductive hypothesis is incorrect. (c) The proof is incorrect because there is no basis step. (d) The proof is incorrect because you cannot add 1 to both sides of the equation in the inductive step. 3. For which of the following is the set S equal to the set of positive integers not divisible by 3? (a) 1 S; x S 2x + 2 S (b) 1 S; x S x + 3 S (c) 1 S; 2 S; x S x + 3 S. (d) 1 S; x S 3x + 1 S 4. Which of the following is a recursive definition for a n = 4n + 3, for n N? (a) a n = 2a n 1 + 1, a 0 = 3. (b) a n = a n 1 + 4n, a 0 = 3. (c) a n = a n 2 + 8, a 0 = 3, a 1 = 7. (d) a n = a n 1 a n 2, a 0 = 3, a 1 = 7. 5. How many permutations of the set {A, B, C, D, E, F, G} either begin or end with a vowel (A or E)? (Note: a permutation of a set contains each letter exactly once.) (a) 2 6! + 2 6!. (b) 2 6! + 2 6! 2 5!. (c) 6! + 6! 5!. (d) 6! + 6!. (e) 7! 5!.

IIT Dept. Applied Mathematics, May 13, 2009 3 6. Consider the statement If the product of two integers is even, then their sum is also even. Circle the letter of the correct assertion. (a) The statement is false as can be shown by finding a counterexample. (b) The statement is true and can be proved most easily by using a direct proof. (c) The statement is true and can be proved most easily using a proof by contradiction. (d) The statement is true and can be proved most easily using a proof by contraposition. 7. Circle the letter of the statement that is true for all sets S and T. (a) S T = S T. (b) S T = S T. (c) S T = S T. (d) (S T ) (T S) = S T. 8. Suppose f : A R has the rule f(x) = 1 x 3. Circle the letter of the set that could be the x domain of A. (a) R. (b) R {0, 1}. (c) R { 1, 1}. (d) R { 1, 0, 1}. 9. Suppose you wanted to prove that the square of every even positive integer ends in 0, 4, or 6. Circle the letter of the proof type that would be easiest to use for this purpose. (a) Proof by contraposition. (b) Direct proof. (c) Proof by cases. 10. (Circle the letter of the correct response.) Suppose you are examining a conjecture of the form x(p (x) Q(x)). If you are looking for a counterexample, you need to find a value of x such that: (a) P (x) and Q(x) are both true. (c) Q(x) is true and P (x) is false. (b) P (x) and Q(x) are both false. (d) P (x) is true and Q(x) is false.

IIT Dept. Applied Mathematics, May 13, 2009 4 x 5 2x 11. Suppose f : R R has the rule f(x) = and suppose g : R R has the rule g(x) =. 2 3 Find (f g)(5). (a) 1. (b) 1. (c) 0. (d) None of these. 12. Let f : A B where A = { 3, 2, 1, 0, 1, 2} and f is defined by the rule f(x) = x 2. For which set B is the function onto B? (a) { 9, 4, 1, 0, 1, 4}. (b) {0, 1, 4, 9}. (c) {0, 1, 4}. (d) { 3, 2, 1, 0, 1, 2}. 13. Find the sum of the geometric series i=1 3 4 i 5 i. (a) 12. (b) 15. (c) 3. (d). 14. Which is the smallest integer n such that f(x) is O(x n ), where f(x) = (x 3 + 1)(x + 2)(x + 2) + x 3 (x + 7)? (a) 4. (b) 5. (c) 6. (d) 7. 15. Compute lcm(2 3 3 2 5 2, 2 2 3 4 7 4 ). Answer:

IIT Dept. Applied Mathematics, May 13, 2009 5 16. Suppose P (x, y) is a predicate where the universe for x, and y {1, 2, 3}. Also suppose that the predicate is true in the following cases P (1, 2), P (2, 1), P (2, 2), P (2, 3), P (3, 1), P (3, 2) and false otherwise. Circle the letter of the quantified statement that is FALSE. (a) y x P (x, y) (b) y x P (x, y) (c) x y (x y P (x, y)) (d) x y P (x, y) 17. Circle the letter of the negation of x y P (x, y). (a) x y P (x, y) (b) x y P (x, y) (c) x yp (x, y) (d) y xp (x, y) 18. Circle the letter of the statement that is true for all sets S and T. (a) S T. (b) (S T ) (T S) =. (c) S T =. (d) S T =. (e) S T. 19. Circle the letter of the contrapositive of the statement If it is dark outside, then I stay at home. (a) If I stay at home, then it is dark outside. (b) It is dark outside and I do not stay at home. (c) If I do not stay at home, then it is not dark outside. (d) If it is not dark outside, then I do not stay at home. 20. Assume that x, y, and z are all real numbers. Circle the letter of the negation of the statement x is positive, or y is negative, or z is positive. (a) If x 0, then y 0 or z 0. (b) x 0 and y 0 and z 0. (c) x is negative and y and z are positive. (d) x 0, and either y 0 or z 0. (e) Either x 0, or y 0 and z 0.

IIT Dept. Applied Mathematics, May 13, 2009 6 21. How many permutations of the letters in the word ARKANSAS are there? (a) P (8, 5) P (3, 3) P (2, 2). (b) C(8, 5) C(5, 3). (c) 8!/(3! + 2!). (d) P (8, 3) P (8, 2). (e) 8!/5!. (f) 8!/(3! 2!). 22. How many distinct integers are necessary to guarantee that two of them have the same remainder when divided by 4? (a) 1 (b) 3 (c) 5 (d) 7 (e) 9 (f) 13 23. Using the Binomial Theorem, find the sum of the series (a) 0 (b) 1 n j=0 ( ) n 2 n j. j (c) 2 n (d) 2 n /2 (e) 3 n (f) 3 n /2 24. If two fair 6-sided dice are rolled, what is the probability of rolling a multiple of 4? (a) 1/4 (b) 1/3 (c) 1/2 (d) 2/3 (e) 3/4 (f) 7/36 25. (2pts) Recall the following properties of a relation R A A (saying a R b is the same as saying (a, b) R: Reflexive: For all a A, a R a. Symmetric: For all a, b A, if a R b, then b R a. Antisymmetric: For all a, b A, if a R b and b R a, then a = b. Transitive: For all a, b, c A, if a R b and b R c, then a R c. Check the box of each property satisfied by the relation R = {(x, y) Z Z x divides y}. reflexive symmetric antisymmetric transitive

IIT Dept. Applied Mathematics, May 13, 2009 7 Part II. Computation, Algorithms, and Examples (6 pts ea.). Show work for full credit. Suggested time 30 minutes. 26. Draw the dots and arrows representation of a relation R from the set X = {x, y, z} to the set A = {a, b, c} that is not a function from X to A. 27. Trace through the Bubble Sort algorithm on the list 2, 4, 3, 5, 1 by writing down the order of the list just before i is incremented. (Part of the question is to determine the last value of i, when the list is in sorted order.) procedure bubblesort(a 1,..., a n : reals with n 2) for i := 1 to n 1 for j := 1 to n i if a j > a j+1 then interchange a j and a j+1 Trace initial list: 2 4 3 5 1 i = 1: i = 2:. 28. An experiment consists of rolling two fair 6-sided dice and flipping one fair coin (a fair coin is equally likely to come up heads or tails ). (a) Write down the sample space S for this experiment in Cartesian product notation. (b) What is the cardinality of S? (c) What is the probability of rolling a 12 and obtaining a tails?

IIT Dept. Applied Mathematics, May 13, 2009 8 29. Give an example of a function f : R R that is strictly increasing but not onto. 30. Determine whether the following two propositions are logically equivalent: r ( s t), r ( s t)

IIT Dept. Applied Mathematics, May 13, 2009 9 Part III. Proofs (5 pts ea.). Write complete line-by-line proofs for full credit. Substantial partial credit for good proof structure. Suggested time 35 minutes. 31. Let U, V, and W be sets. Prove or disprove that (U V ) (U W ) = U (V W ). A Venn diagram is helpful, but not a proof. 32. Prove that there are no positive integer solutions to the equation 4x 2 + 2y 2 = 28.

IIT Dept. Applied Mathematics, May 13, 2009 10 33. Let m be a positive integer. Prove that for all integers a, b, and c, if a b (mod m), then a c b c (mod m). 34. A sequence is defined by a 1 = 1, a 2 = 16, and a n = 3a n 1 + 4a n 2 for all n 3. Prove that a n 4 n for all positive integers n.

Workspace (clearly indicate the problem number) 11

Workspace (clearly indicate the problem number) 12