Math 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.
|
|
- Augusta Gibson
- 5 years ago
- Views:
Transcription
1 Math 20 Exam 2 - Practice Problems. For each of the following, determine whether the statement is True or False. (a) {a,b,c,d} TRE (b) {a,b,c,d} FLSE (c) {a,b, } TRE (d) {a,b, } TRE (e) {a,b} {a,b} FLSE (f) 0 {0,{},{0,}} TRE (g) {0,{},{0,}} FLSE (h) {0,} {0,{},{0,}} TRE (i) {0,} {0,{},{0,}} FLSE 2. Given the set = {a,b,{a,b}} (a) Find. (b) Find P() = 3 P() = {,{a},{b},{{a,b}},{a,b},{a,{a,b}},{b,{a,b}},{a,b,{a,b}}} 3. Given that = {,2,3} and = {a,b,c,d,e,f} (a) List the elements in. = {(,),(,2),(,3),(2,),(2,2),(2,3),(3,),(3,2),(3,3)} (b) How many elements are in? = = 3 6 = 8. (c) How many elements are in ( )? First notice that = = 6 6 = 36. Then ( ) = = 3 36 = Find the set of all elements that make the predicate Q(x) : x 2 < x true (where the domain of x is all real numbers). First notice that if x >, then x x > x, so x 2 > x. If x < 0, then since x 2 > 0 for all real x, x 2 > 0 > x. If x = 0, then 0 2 = 0. Similarly, if x =, then 2 =. If 0 < x <, then x x < x, or x 2 < x. Hence the set of all elements that make the predicate Q(x) : x 2 < x true is = {x 0 < x < }. 5. Given that = {0,2,4,6,8,0,2}, = {0,2,3,5,7,,2} and = {,2,3,4,6,7,8,9} are all subsets of the universal set = {0,,2,3,4,5,6,7,8,9,0,,2}, find each of the following: (a) = {4,6,8,0} (b) = {,3,5,7,9,} (c) = {0,2,2} (d) ( ) = {2,3,7}, so ( ) = {0,2,3,4,6,7,8,0,2} (e) ( ) = {,4,6,8,9,0}, so = {2,3,7,0}. Hence ( ) = {0,4,6,8,2} (f) ( ) ( ) = {2,4,6,8}, = {,3,5,7,9,}, and so = {0,2,2}. Thus ( ) ( ) = {0,2,4,6,8,2}
2 6. Draw Venn Diagrams representing each of the following sets: (a) (c) ( ) (e) ( ) (b) (d) (f) ( ) 7. se a membership table to show that ( ) ( ) = ( ). ( ) ( ) ( ) Since the last columns of these membership tables are identical, these two sets are equal. 8. se a 2-column proof to verify the set identity: ( ) =. Statement Reason ( ) Given = {x (x ) [(x ) (x )]} Definition of union and definition of intersection. = {x x } bsorption Law for logical statements. = Definition of The proof given in the table above verifies that these sets are equal, so this identity is always valid. 9. For each of the following, either prove the statement or show that it is false using a counterexample. (a) ( ) = ( ) FLSE. onsider the counterexample: = {,2,3,4}, = {2,3,5}, and = {3,4,5,6}. Then = {,4}, so ( ) = {}, while = {2}, so ( ) = {,3,4}. Then ( ) ( )
3 (b) ( ) = ( ) We will prove this equality using membership tables: ( ) ( ) Since the last columns of these membership tables are identical, these two sets are equal. (c) ( ) = ( ) ( ) ( ( ) ( ) ( ) Since the last columns of these membership tables are identical, these two sets are equal. 0. onsider the function f(x) = x (a) Suppose that the domain of this function is R and the co-domain is R. Find the range of f. Is f -? Is f onto? Justify your answers. Recall that if x 0, then f(x) = x and if x < 0, then f(x) = x. From this, we see that the range of f is {x : x R,x 0}. Notice that f() = f( ) =, so f is not one-to-one. ased on the range we found, we see that f is not onto. For example, there is no x that maps to. (b) Suppose that the domain of this function is N and the co-domain is N. Find the range of f. Is f -? Is f onto? Justify your answers. If we change the domain and co-domain to N, then f has range {x : x N} = N. Thus f is onto. With the given domain and co-domain, f is also one-to-one, since on this domain, f(x) = x for all x N. (c) Suppose S = { 2,,0,,2}. Find f(s) (the image of the set S under f). Find f (S) (the preimage of the set S under f). f(s) = {0,,2}. However, since 2 and are not legal images, f (S) is undefined.
4 . For each of the following functions, determine whether f is a one-to-one. lso determine whether f is onto. Justify your answers. (a) f : R R, f(x) = x 3 x Notice that f(0) = f() = 0. Therefore, f is not one-toone. To see that f is onto, notice that f (x) = 3x 2, so f (x) 0 whenever x (d) f : Z Z Z f(m,n) = m 2 n From this, we can deduce that f is increasing both on (, ] and on [, ). lso, note that lim f(x) = and lim f(x) =. x x Finally, since f() = 0 and f( ) = 0, f attains all positive values in R on the interval [, ), and f attains all negative values in R on the interval (, ]. Thus f is onto. (b) f : R + R + f(x) = x 2 Notice that since we have restricted the domain to include only positive values, if f(a) = f(b), then a 2 = b 2, so a = b. Hence f is one-to-one. lso, if we consider k R + and let x = k (which is defined since k 0). Then f(x) = ( k) 2 = k. (c) f : Z Z Z f(m,n) = m 2 n f is not one-to-one, since f(,) = f(,) = f(0,0) = 0. f is onto. To see this, let k N. Let m = 0, and n = k. Then f(m,n) = 0 ( k) = k. f is not one-to-one, since f(,) = f(,) = f(0,0) = 0. f is not onto. To see this, let k = 6. Now, the square numbers are 0,,4,9,6,25,36,... If we subtract consecutive squares, as we proved on a previous homework exercise, we get the odd numbers,3,5,7,9,,. To obtain an even difference, we must subtract nonconsecutive squares. Notice that 4 0 = 4, 9 = 8, and 6 4 = 2. Since our previous result shows that the difference between perfect squares increases as their size increases, we can see that there is no way of writing 6 as a difference of two perfect squares. Hence f is not onto. [Notice that we could prove that the difference between twoperfectsquaresiseitheroddorisamultipleof4, but that goes beyond what was asked for in this problem.] 2. Prove or Disprove: Suppose f : and g :. If f is one-to-one and g is onto, then f g is one to one. This statement is false. For example, Let = = = N consider f(n) = n and g(n) = n 2. f is the identity map, so f is one-to-one. g is onto since g(2n) = n for all n. However, notice that (f g)(n) = g(n) for all n. Therefore, f g is not one-to-one, since (f g)() = (f g)(2) =. 3. Prove or Disprove: Suppose f : and g :. If f is one-to-one and g is onto, then f g is onto. This statement is false. For example, Let = = = N consider f(n) = 2n and g(n) = n. g is the identity map, so g is one-to-one. f is one-to-one since if f(a ) = f(a 2 ), then 2a = 2a 2, so a = a 2. However, notice that (f g)(n) = 2n for all n. Therefore, f g is not onto, since there is no input n such that (f g)(n) =. 4. Find the first five terms of each of the following sequences (start with n = ): (a) a n = 3n (b) b n = ( ) n n 2 (c) c n = n n a = 2, a 2 = 5, a 3 = 8, a 4 =, a 5 = 4 b =, b 2 = 4, b 3 = 9, b 4 = 6, b 5 = 25 c = 0 =, c 2 = 2 = 2, c 3 = 3 2 = 9, c 4 = 4 3 = 64, c 5 = 5 4 = 625 (d) a n = 2a n, a 0 = 5 (e) b n = b n +n 2, b 0 = 7 (f) c n = c n +nc n 2, c 0 = 2, c = 3 a = 0, a 2 = 20, a 3 = 40, a 4 = 80, a 5 = 60 b = 7 + = 8, b 2 = = 2, b 3 = 2+9 = 2, b 4 = 2+6 = 37, b 5 = = 62 c = 3, c 2 = 3 + 2(2) = 7, c 3 = 7+3(3) = 6, c 4 = 6+4(7) = 44, c 5 = 44+5(6) = Find three different sequences beginning with the terms a =, a 2 = 2 and a 3 = 4. There are many possible answers to this question. Here are some possibilities: a n = 2 n b n = b n +b n 2 +; b = ; b 2 = 2 c n = 2c n ; c =
5 6. Determine whether or not each of the following is a solution to the recurrence relation a n = 8a n 6a n 2 (a) a n = 0 (b) a n = 2 n Notice that if a n = 0 for all n, then 8a n 6a n 2 = 8(0) 6(0) = 0 = a n, so this sequence is a solution to the given recurrence relation. Notice that if a n = 2 n for all n, then 8a n 6a n 2 = 8(2 n ) 6(2 n 2 ) = n n 2 = 4 2 n 4 2 n = 0 a n, so this sequence is not a solution to the given recurrence relation. (c) a n = n4 n (d) a n = 2 4 n +3n 4 n Notice that if a n = n4 n for all n, then 8a n 6a n 2 = 8((n )4 n ) 6((n 2)4 n 2 ) = 2(4)4 n (n ) n 2 (n 2) = 2(4 n )(n ) 4 n (n 2) = 4 n [2(n ) (n 2)] = 4 n [2n 2 n+2] = 4 n n = n4 n, sothissequenceisasolutiontothegivenrecurrence relation. Notice that if a n = 2 4 n + 3n 4 n for all n, then 8a n 6a n 2 = 8(2 4 n +3(n ) 4 n ) 6((2 4 n 2 + 3(n 2) 4 n 2 ) = 8 4 n [2+3(n )] 6 4 n 2 [2+3(n 2)] = 2 4 n [2+3n 3] 4 n [2+3n 6] = 4 n [2(3n ) 3n 4] = 4 n (3n+2) = 2 4 n + 3n 4 n, so this sequence is a solution to the given recurrence relation. 7. Find a recurrence relation satisfying each of the following: (a) a n = 3n 2 a n = a n +3; a = (b) a n = 3 n a n = 3a n +3; a 0 = (c) a n = n 2 a n = a n +2n ; a 0 = 0 8. Find the solution to each of the following recurrence relations and initial conditions (a) a n = 4a n, a 0 = Notice that a n = 4a n and a n = 4a n 2. Therefore, a n = 4(4a n 2 ) = 4 2 a n 2. ontinuing in this fashion, a n = 4 2 a n 2 = 4 2 (4a n 3 ) = 4 3 a n 3 = = 4 n a 0 where a 0 =. Hence this sequence has explicit form: a n = 4 n. (b) a n = a n +4, a 0 = 4 Notice that a n = a n +4 and a n = a n Therefore, a n = (a n 2 +4)+4 = a n 2 +2(4). ontinuing in this fashion, a n = a n 2 +2(4) = (a n 3 +4)+2(4) = a n 3 +3(4) = = a 0 +n(4) where a 0 = 4. Hence this sequence has explicit form: a n = 4n+4. (c) a n = a n +n, a 0 = Notice that a n = a n +n and a n = a n 2 +(n ). Therefore, a n = a n 2 +(n )+n. ontinuing in this fashion, a n = a n 3 +(n 2)+(n )+n = = a 0 + n k where a 0 =. Hence a n = + n n(n+) k = + 2 = n2 +n ompute the value of each of the following summations: (a) 5 2k = = 30 (b) 3 3 i = = 40 (c) i=0 3 j=3 5 = (5) = 55 (d) (e) (f) 5 2 j 2j = (4 4)+(8 6)+(6 8)+(32 0) = = 32 j= ij 2 ( = i(0 2 )+i( 2 )+i(2 2 ) ) 3 = 5i = 5()+5(2)+5(3) = 30 i= i= i= ij 2 ( = j 2 +2j 2) 2 = 3j 2 = 3(0)+3()+3(2) = 9 i=
6 20. Prove that n 5 n is divisible by 5 for any non-negative integer n. We will proceed by induction. ase ase: n = 0 Notice that = 0. Since 5 0 = 0, 0 is divisible by 5. Induction Step: Suppose that k 5 k is divisible by 5, and consider (k +) 5 (k +). Expanding this, (k+) 5 (k+) = (k 5 +5k 4 +0k 3 +0k 2 +5k+) (k+) = k 5 +5k 4 +0k 3 +0k 2 +(5k k) = 5k 4 +0k 3 +0k 2 +5k +(k 5 k). Since 5 divides k 5 k, by the induction hypothesis, 5 divides every term of the previous expression. This 5 divides (k +) 5 (k +). Hence n 5 n is divisible by 5 for any non-negative integer n.. 2. Prove that for r R, r and for all integers n, r j = rn+ r We will proceed by induction. ase ase: n = 0. Then r ). r j = r 0 =. While rn+ r = r r = (provided Induction Step: Suppose that k r j = rk+ r k+ and consider r j. k+ Then r j = k = rk+ +r k+2 r k+ r 22. Prove that for all n 2, r j +r k+ = rk+ r = rk+2 r k 2 < 2 n +r k+ = rk+ r We will proceed by induction. ase ase: n = 2. Then Induction Step: Suppose n+ n k 2 =. 2 k 2 < 2 n+ n and consider k 2. + rk+ (r ) r k 2 + (n+) 2 < 2 n + (n+) 2 = 2 n2 +2n+ n(n+) 2 + k 2 = + 4 = 5 4 < 2 2 = 3 2. n n(n 2 +2n+) = 2 n2 +n+ n(n+) 2 = 2 n2 +n n(n+) 2 n(n+) 2 = 2 n+ n(n+) 2 < 2 n+ Hence for all n 2, k 2 < 2 n. 23. Prove that n! < n n whenever n >. ase ase: n = 2. Then 2! = 2 while 2 2 = 2. Then 2 < 4. Induction Step: Suppose k! < k k and consider (k +)! Lemma: If 0 < x < y, then x n < y n for all n. ase ase: When n =, x < y. Inductive step: If x n < y n, then x x n = x n+ < x y n. Similarly, x y n < y y n = y n+ Hence x n+ < y n+.. pplying the Lemma, Since k < k +, k k < (k +) k. y the induction hypothesis, (k +)! = k!(k +) < k k (k +). Thus (k +)! < (k +) k (k +) = (k +) k+.
7 24. Prove that for all n, ase ase: n =. Then Induction Step: Suppose (2k )(2k +) = n 2n+ n+ sing the induction hypothesis, (2k )(2k +) = ()(3) = 3, while n 2n+ = 2+ = 3 (2k )(2k +) = n n+ 2n+ and consider (2k )(2k +). (2k )(2k +) = n 2n+ + (2n+)(2n+3) = = 2n2 +3n+ (2n+)(2n+3) = (2n+)(n+) (2n+)(2n+3) = n+ 2n+3 = n+ 2(n+)+. n(2n+3) (2n+)(2n+3) + (2n+)(2n+3)
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.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More information1. 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
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Sets and Functions The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Define the
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationReview 1. Andreas Klappenecker
Review 1 Andreas Klappenecker Summary Propositional Logic, Chapter 1 Predicate Logic, Chapter 1 Proofs, Chapter 1 Sets, Chapter 2 Functions, Chapter 2 Sequences and Sums, Chapter 2 Asymptotic Notations,
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationFunctions as Relations
Functions as Relations Definition Recall that if A and B are sets, then a relation from A to B is a subset of A B. A function from A to B is a relation f from A to B with the following properties (i) The
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationExam Practice Problems
Math 231 Exam Practice Problems WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the topics.
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationMidterm Preparation Problems
Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then
More informationRecitation 7: Existence Proofs and Mathematical Induction
Math 299 Recitation 7: Existence Proofs and Mathematical Induction Existence proofs: To prove a statement of the form x S, P (x), we give either a constructive or a non-contructive proof. In a constructive
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationAll numbered readings are from Beck and Geoghegan s The art of proof.
MATH 301. Assigned readings and homework All numbered readings are from Beck and Geoghegan s The art of proof. Reading Jan 30, Feb 1: Chapters 1.1 1.2 Feb 6, 8: Chapters 1.3 2.1 Feb 13, 15: Chapters 2.2
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationFunctions. Given a function f: A B:
Functions Given a function f: A B: We say f maps A to B or f is a mapping from A to B. A is called the domain of f. B is called the codomain of f. If f(a) = b, then b is called the image of a under f.
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008) Problem 1: Suppose A, B, C and D are arbitrary sets.
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationEquivalence of Propositions
Equivalence of Propositions 1. Truth tables: two same columns 2. Sequence of logical equivalences: from one to the other using equivalence laws 1 Equivalence laws Table 6 & 7 in 1.2, some often used: Associative:
More informationA n = A N = [ N, N] A n = A 1 = [ 1, 1]. n=1
Math 235: Assignment 1 Solutions 1.1: For n N not zero, let A n = [ n, n] (The closed interval in R containing all real numbers x satisfying n x n). It is easy to see that we have the chain of inclusion
More information1 Homework. Recommended Reading:
Analysis MT43C Notes/Problems/Homework Recommended Reading: R. G. Bartle, D. R. Sherbert Introduction to real analysis, principal reference M. Spivak Calculus W. Rudin Principles of mathematical analysis
More informationPractice Exam 1 CIS/CSE 607, Spring 2009
Practice Exam 1 CIS/CSE 607, Spring 2009 Problem 1) Let R be a reflexive binary relation on a set A. Prove that R is transitive if, and only if, R = R R. Problem 2) Give an example of a transitive binary
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationDirect Proof Universal Statements
Direct Proof Universal Statements Lecture 13 Section 4.1 Robb T. Koether Hampden-Sydney College Wed, Feb 6, 2013 Robb T. Koether (Hampden-Sydney College) Direct Proof Universal Statements Wed, Feb 6, 2013
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationLecture Notes: Mathematical/Discrete Structures
Lecture Notes: Mathematical/Discrete Structures Rashid Bin Muhammad, PhD. This booklet includes lecture notes, homework problems, and exam problems from discrete structures course I taught in Fall 2006
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationMTH 299 In Class and Recitation Problems SUMMER 2016
MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation
More informationMath 230 Final Exam, Spring 2009
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
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationIn 1854, Karl Weierstrauss gave an example of a continuous function which was nowhere di erentiable: cos(3 n x) 2 n. sin(3 n x), 2
Why non-pictured analysis? CHAPTER 1 Preliminaries f is continuous at x if lim f(x + h) = f(x) h!0 and f(x + h) f(x) f is di erentiable at x if lim h!0 h Then but Di erentiability =) continuity, continuity
More informationMathematical Fundamentals
Mathematical Fundamentals Sets Factorials, Logarithms Recursion Summations, Recurrences Proof Techniques: By Contradiction, Induction Estimation Techniques Data Structures 1 Mathematical Fundamentals Sets
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
More informationIVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics
IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra
More information1.1 Inductive Reasoning filled in.notebook August 20, 2015
1.1 Inductive Reasoning 1 Vocabulary Natural or Counting Numbers Ellipsis Scientific Method Hypothesis or Conjecture Counterexample 2 Vocabulary Natural or Counting Numbers 1, 2, 3, 4, 5... positive whole
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.
Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of
More informationMathematics 220 Midterm Practice problems from old exams Page 1 of 8
Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then
More informationMAT 300 RECITATIONS WEEK 7 SOLUTIONS. Exercise #1. Use induction to prove that for every natural number n 4, n! > 2 n. 4! = 24 > 16 = 2 4 = 2 n
MAT 300 RECITATIONS WEEK 7 SOLUTIONS LEADING TA: HAO LIU Exercise #1. Use induction to prove that for every natural number n 4, n! > 2 n. Proof. For any n N with n 4, let P (n) be the statement n! > 2
More informationMath 3000 Section 003 Intro to Abstract Math Homework 6
Math 000 Section 00 Intro to Abstract Math Homework 6 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 01 Solutions April, 01 Please note that these solutions are
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More information447 HOMEWORK SET 1 IAN FRANCIS
7 HOMEWORK SET 1 IAN FRANCIS For each n N, let A n {(n 1)k : k N}. 1 (a) Determine the truth value of the statement: for all n N, A n N. Justify. This statement is false. Simply note that for 1 N, A 1
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring
c Dr Oksana Shatalov, Spring 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationReview 3. Andreas Klappenecker
Review 3 Andreas Klappenecker Final Exam Friday, May 4, 2012, starting at 12:30pm, usual classroom Topics Topic Reading Algorithms and their Complexity Chapter 3 Logic and Proofs Chapter 1 Logic and Proofs
More informationIntro to Algebra Today. We will learn names for the properties of real numbers. Homework Next Week. Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38
Intro to Algebra Today We will learn names for the properties of real numbers. Homework Next Week Due Tuesday 45-47/ 15-20, 32-35, 40-41, *28,29,38 Due Thursday Pages 51-53/ 19-24, 29-36, *48-50, 60-65
More informationCSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Review for the Final! Hyunyoung Lee! 1 Final Exam Section 501 (regular class time 8:00am) Friday, May 8, starting at 1:00pm in our classroom!! Section 502 (regular
More informationMathematical Structures Combinations and Permutations
Definitions: Suppose S is a (finite) set and n, k 0 are integers The set C(S, k) of k - combinations consists of all subsets of S that have exactly k elements The set P (S, k) of k - permutations consists
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More information3.4 Set Operations Given a set A, the complement (in the Universal set U) A c is the set of all elements of U that are not in A. So A c = {x x / A}.
3.4 Set Operations Given a set, the complement (in the niversal set ) c is the set of all elements of that are not in. So c = {x x /. (This type of picture is called a Venn diagram.) Example 39 Let = {1,
More informationPreparing for the CS 173 (A) Fall 2018 Midterm 1
Preparing for the CS 173 (A) Fall 2018 Midterm 1 1 Basic information Midterm 1 is scheduled from 7:15-8:30 PM. We recommend you arrive early so that you can start exactly at 7:15. Exams will be collected
More informationReview Problems for Midterm Exam II MTH 299 Spring n(n + 1) 2. = 1. So assume there is some k 1 for which
Review Problems for Midterm Exam II MTH 99 Spring 014 1. Use induction to prove that for all n N. 1 + 3 + + + n(n + 1) = n(n + 1)(n + ) Solution: This statement is obviously true for n = 1 since 1()(3)
More information1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More information3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to
More informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More informationName CMSC203 Fall2008 Exam 2 Solution Key Show All Work!!! Page (16 points) Circle T if the corresponding statement is True or F if it is False.
Name CMSC203 Fall2008 Exam 2 Solution Key Show All Work!!! Page ( points) Circle T if the corresponding statement is True or F if it is False T F GCD(,0) = 0 T F For every recursive algorithm, there is
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationWritten Homework # 4 Solution
Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.
More informationCMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.
More informationChapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures
Chapter 2 Section 2.1: Proofs Proof Techniques CS 130 Discrete Structures Some Terminologies Axioms: Statements that are always true. Example: Given two distinct points, there is exactly one line that
More informationAnalysis of California Mathematics standards to Common Core standards Algebra I
Analysis of California Mathematics standards to Common Core standards Algebra I CA Math Standard Domain Common Core Standard () Alignment Comments in 1.0 Students identify and use the arithmetic properties
More informationExample: Use a direct argument to show that the sum of two even integers has to be even. Solution: Recall that an integer is even if it is a multiple
Use a direct argument to show that the sum of two even integers has to be even. Solution: Recall that an integer is even if it is a multiple of 2, that is, an integer x is even if x = 2y for some integer
More informationAppendix G: Mathematical Induction
Appendix G: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationQuiz 1. Directions: Show all of your work and justify all of your answers.
Quiz 1 1. Let p and q be the following statements. p : Maxwell is a mathematics major. q : Maxwell is a chemistry major. (1) a. Write each of the following in symbolic form using logical connectives. i.
More informationREVIEW FOR THIRD 3200 MIDTERM
REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =
More informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More information8. 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
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationCS Discrete Mathematics Dr. D. Manivannan (Mani)
CS 275 - Discrete Mathematics Dr. D. Manivannan (Mani) Department of Computer Science University of Kentucky Lexington, KY 40506 Course Website: www.cs.uky.edu/~manivann/cs275 Notes based on Discrete Mathematics
More information1. From Lewis Carroll: extract a pair of premises and finish the conclusion.
Math 2200 2. Treibergs σιι First Midterm Exam Name: Sample January 26, 2011 Sample First Midterm Questions. Sept. 17, 2008 and Sept. 16, 2009. Some questions from Math 3210 Midterms of 1. From Lewis Carroll:
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More information