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.
|
|
- Ethel Dorsey
- 5 years ago
- Views:
Transcription
1 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 such that A B = C D and C = D. Prove or disprove: A = B. The statement is false. The following is a counterexample. A = {1}, B = {a, b, c, d}, C = {x, y} and D = {p, q}. Here, A B = {(1, a), (1, b), (1, c), (1, d)} and A B = 4. Note that C = D = 2. Further, C D = {(x, p), (x, q), (y, p), (y, q)} and C D = 4. Thus, even though the conditions A B = C D and C = D hold, A B. Problem 2: Suppose A and B are subsets of a universal set U. Prove that A B if and only if B A. No credit will be given if you use Venn diagrams to prove this result. Part 1: We need to show that A B B A. In other words, under the assumption that A B, we need to show that for any x, the implication x B x A holds. Now, This completes the proof of Part 1. x B x B (Definition of set complement) x A (since A B) x A (Definition of set complement). Part 2: We need to show that B A A B. In other words, under the assumption that B A, we need to show that for any x, the implication x A x B holds. Now, x A x A (Definition of set complement) x B (since B A) x B (Definition of set complement). This completes the proof of Part 2 as well as that of the result. Problem 3: Recall that the NAND operator (denoted by ) is equivalent to AND followed by negation; that is, for any two propositions a and b, the propositional form (a b) is logically equivalent to (a b). Express the propositional form c (a b) using only the NAND operator. First note that, by the definition of NAND, c (a b) [c (a b)] Let X denote [c (a b)]. Thus, the given expression c (a b) X X X. Therefore, we can now focus on expressing X using only the NAND operator. Now, 1
2 X [c (a b)] [c ( a b)] (Implication rule) [c ( (a b)] (De Morgan s law) [c (a ( b))] (Definition of NAND) [c (a (b b))] (since b (b b)) Thus we have an expression for X using only the NAND operator. Since the given expression c (a b) is equivalent to X X, we have [c (a b)] [c (a (b b))] [c (a (b b))]. Problem 4: Specify a predicate P (x, y) over the set of integers so that all the following conditions are satisfied: x y P (x, y) is false, x y P (x, y) is false and y x P (x, y) is true. Your answer should clearly specify a predicate P (x, y) and explain why the predicate satisfies all the three conditions. Let P (x, y) denote the predicate x = y 2, where x and y take on integer values. (a) The proposition x y P (x, y) is false, since for x = 5, there is no integer y such that 5 = y 2. (b) The proposition x y P (x, y) is also false. To see this, consider two y values, say y = 1 and y = 2. There is no x value that satisfies both the equations x = 1 2 and x = 2 2. (c) The proposition y x P (x, y) is true since for any given value of y, we can choose x to be y 2 to satisfy the equation x = y 2. Problem 5: Let X be a set with 8 elements. How many binary relations on X are either reflexive or symmetric or both? Show work. You need not simplify your answer. To solve this problem, we use the fact that each binary relation on a set with n elements can be represented by an n n Boolean matrix. Let B 1 denote the set of all binary relations over X that are reflexive and let B 2 denote the set of all binary relations over X that are symmetric. Thus, the required answer = B 1 B 2. From the inclusion-exclusion formula, we have B 1 B 2 = B 1 + B 2 B 1 B 2. We now show how each of the cardinality values on the right side of the above equation can be computed. (a) B 1 is the number of reflexive binary relations on X. As mentioned above, any binary relation on X can be represented by an 8 8 Boolean matrix, which has 64 entries. Of these, all the 8 main diagonal entries must be 1, since the relation is reflexive. There are two choices for each of the remaining 56 entries. Hence, B 1 = (b) B 2 is the number of binary relations on X that are symmetric. Again, any binary relation on X is represented by an 8 8 Boolean matrix with 64 entries. Of these, 8 are along the main diagonal, 28 are above the main diagonal and 28 are below the main diagonal. When the relation is symmetric, once we choose a 0 or 1 value for each entry above the diagonal, all the entries 2
3 below the diagonal are determined. Also, there are two choices for each of the 8 entries along the diagonal. Hence, we have two choices for each of the 28+8 = 36 entries which are at or above the main diagonal, but only one choice for each entry below the diagonal. Therefore, B 2 = (c) B 1 B 2 is the number of binary relations on A that are both reflexive and symmetric. Here, we have two choices for each of the 28 entries above the diagonal, but only one choice for each of the other entries. In other words, B 1 B 2 = Now, using the inclusion-exclusion formula above, the required answer is Problem 6: Let A = {x, y, z}. Specify a binary relation R on A such that R is not transitive but the symmetric closure of R is transitive. Your answer should clearly specify the relation R and and explain why R is not transitive but the symmetric closure of R is transitive. Consider the binary relation R on A defined by R = {(x, x), (y, y), (z, z), (x, y), (y, z), (z, x)}. Now, R is not transitive since (x, y) R, (y, z) R but (x, z) R. Recall that for any binary relation R, the symmetric closure R of R is given by R = R R 1 where R 1, the converse of R, is the relation obtained by flipping each pair in R. Thus, for the relation R above, R 1 = {(x, x), (y, y), (z, z), (y, x), (z, y), (x, z)}. Therefore, R = R R 1 = {(x, x), (y, y), (z, z), (x, y), (y, z), (z, x), (y, x), (z, y), (x, z)}. Note that R = A A; that is, R contains every possible ordered pair that can be formed from the three elements x, y and z. Thus, R is transitive. ( x Problem 7: Find the coefficient of x 2 5 in the expansion of ) 10 x 3. Show work. You need not simplify your answer. Suppose the term x 2 occurs as the i th term in the expansion. In that term, the factor involving x is [(x 5 ) i ] [(x 3 ) 10 i ] = x 5i x 3(10 i) = x 8i 30. Since we want the exponent of x to be 2, we have the equation for which the solution is i = 4. 8i 30 = 2 By the Binomial Theorem, the 4th term of the above expansion is Therefore, the coefficient of x 2 is C(10, 4) 3 6 /2 4. C(10, 4) ( 1/2) x 2. Problem 8: Find the number of solutions to the equation x 1 + x 2 + x 3 + x 4 + x 5 = 74 where x 1, x 2 and x 3 are nonnegative integers, x 4 is an integer satisfying the condition x 4 15 and x 5 is an integer satisfying the condition 0 x 5 < 4. Show work. You need not simplify your answer. 3
4 In this problem, we will use the fact that the number of solutions to the equation z 1 + z z r = q where z 1, z 2,..., z r and q are all non-negative integers, is = C(q + r 1, r 1). To solve the given problem, first define a new variable y 4 = x Since x 4 15, we have y 4 0. Substituting for x 4 in terms of y 4 in the given equation, we get x 1 + x 2 + x 3 + y 4 + x 5 = = 59 (1) Let N 1 denote the number of solutions to Equation (1) where each of the variables is a non-negative integer. Using the formula mentioned above, N 1 = C( , 5 1) = C(63, 4). In some of these solutions, x 5 satisfies the condition x 5 < 4 while in others, x 5 4. So, if we find the number of solutions, say N 2, where x 5 4, then the required solution to the problem is N 1 N 2. To find N 2, we proceed in a manner similar to that of N 1. Define a new variable y 5 = x 5 4. Thus, when x 5 4, y 5 0. We substitute for x 5 using y 5 in Equation (1) to get the new equation x 1 + x 2 + x 3 + y 4 + y 5 = 59 4 = 55 (2) The number of solutions N 2 to Equation (2) where each variable is a non-negative integer is = C( , 5 1) = C(59, 4). Therefore, the required answer is N 1 N 2 = C(63, 4) C(59, 4). Problem 9: Suppose A = {x, y, z, w} and B = {1, 2, 3, 4, 5}. How many functions from A to B are not one-to-one? Since A = 4 and B = 5, the total number of functions from A to B = 5 4 = 625. If N denotes the number of one-to-one functions from A to B, then the required answer is 625 N. We can find the value of N as follows. In constructing a one-to-one functions from A to B, there are 5 choices for x, 4 choices for y, 3 choices for z and 2 choices for w. Thus, N, the number of one-to-one functions from A to B = = 120. Hence, the number of functions from A to B that are not one-to-one = = 505. Problem 10: Let R denote the set of real numbers. Consider the function f on R R defined by f(x, y) = (x + y, 2x 3y). (a) Is f one-to-one? Justify your answer. (b) Is f onto? Justify your answer. Part (a): Yes, f is one-to-one. To prove this, we will show that if f(x, y) = f(x, y ) then x = x and y = y. Since f(x, y) = f(x, y ), we have the two equations x + y = x + y 2x 3y = 2x 3y 4
5 If we multiply the first equation by 2 and subtract the result from the second equation, we get 5y = 5y from which we conclude that y = y. This result in conjunction with the equation x + y = x + y implies that x = x. Thus, f is one-to-one. Part (b): Yes, f is onto. To prove this, we need to show that for any pair (a, b) R R, there is a pair (x, y) R R such that f(x, y) = (a, b). This can be shown as follows. From the definition of f, the equation f(x, y) = (a, b) leads to the two equations x + y = a and 2x 3y = b. The solution to these linear equations is x = (3a + b)/5 and y = (2a b)/5. This completes the proof that f is an onto function. Problem 11: Use induction to prove that for all integers n 0, n 3 + (n + 1) 3 + (n + 2) 3 is divisible by 9. Basis: n = 0. When n = 0, n 3 + (n + 1) 3 + (n + 2) 3 = = 9, which is divisible by 9. So, the basis is true. Induction Hypothesis: Assume that for some integer k 0, k 3 + (k + 1) 3 + (k + 2) 3 is divisible by 9. To prove: (k + 1) 3 + (k + 2) 3 + (k + 3) 3 is divisible by 9. Proof: By the inductive hypothesis, k 3 + (k + 1) 3 + (k + 2) 3 is divisible by 9; that is, k 3 + (k + 1) 3 + (k + 2) 3 = 9t (3) for some integer t. Now, (k + 1) 3 + (k + 2) 3 + (k + 3) 3 = (k + 1) 3 + (k + 2) 3 + k 3 + 9k k + 27 (Expansion of (k + 3) 3 ) = [k 3 + (k + 1) 3 + (k + 2) 3 ] + 9[k 2 + 3k + 3] (Rearrangement of terms) = 9t + 9[k 2 + 3k + 3] (By Equation (3)) = 9[t + k 2 + 3k + 3] The last step above shows that (k + 1) 3 + (k + 2) 3 + (k + 3) 3 is divisible by 9, and this completes the proof. 5
6 Problem 12: Let S = {1, 2, 3, 4, 5, 6, 7, 8, 9}. Prove that every subset of S with 6 or more elements must contain two numbers whose difference is equal to 5. Proof: Let A = {x 1, x 2,... x r } be any subset of S with 6 or more elements. We must show that there are two elements in A whose difference is equal to 5. Partition S into the following five subsets: S 1 = {1, 6}, S 2 = {2, 7}, S 3 = {3, 8}, S 4 = {4, 9} and S 5 = {5}. Note that in each of the sets S 1 through S 4, the difference between the two elements in the set is exactly 5. Consider the function that assigns each element x i of A to the unique set among S 1 through S 5 which contains x i. Since the elements of A are distinct, at most one element of A can be assigned to S 5. The remaining five or more elements of A must be assigned to the four sets S 1 through S 4. By the pigeon hole principle, at least two elements of A, say x i and x j, must be assigned to the same set S k, for some k {1, 2, 3, 4}. Thus, the difference between the elements x i and x j in A is equal to 5, and this completes the proof. 6
Department 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 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 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 informationMath 230 Final Exam, Spring 2008
c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationMath 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.
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
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
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 informationMATH 363: Discrete Mathematics
MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The
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 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 informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationSet Theory. CSE 215, Foundations of Computer Science Stony Brook University
Set Theory CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Set theory Abstract set theory is one of the foundations of mathematical thought Most mathematical
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationProving simple set properties...
Proving simple set properties... Part 1: Some examples of proofs over sets Fall 2013 Proving simple set properties... Fall 2013 1 / 17 Introduction Overview: Learning outcomes In this session we will...
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
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 informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
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 informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
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 informationCSE 20. Final Review. CSE 20: Final Review
CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationCHAPTER 1 SETS AND EVENTS
CHPTER 1 SETS ND EVENTS 1.1 Universal Set and Subsets DEFINITION: set is a well-defined collection of distinct elements in the universal set. This is denoted by capital latin letters, B, C, If an element
More informationCSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
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 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 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 informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationExercises 1 - Solutions
Exercises 1 - Solutions SAV 2013 1 PL validity For each of the following propositional logic formulae determine whether it is valid or not. If it is valid prove it, otherwise give a counterexample. Note
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
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 informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationDiscrete Mathematics Exam File Spring Exam #1
Discrete Mathematics Exam File Spring 2008 Exam #1 1.) Consider the sequence a n = 2n + 3. a.) Write out the first five terms of the sequence. b.) Determine a recursive formula for the sequence. 2.) Consider
More informationCS280, Spring 2004: Final
CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationDiscrete Structures: Sample Questions, Exam 2, SOLUTIONS
Discrete Structures: Sample Questions, Exam 2, SOLUTIONS (This is longer than the actual test.) 1. Show that any postage of 8 cents or more can be achieved by using only -cent and 5-cent stamps. We proceed
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 information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions 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
More informationAlgebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.
Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots. A1.1.1 Compare real number expressions. A1.1.2 Simplify square
More informationA Semester Course in Basic Abstract Algebra
A Semester Course in Basic Abstract Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved December 29, 2011 1 PREFACE This book is an introduction to abstract algebra course for undergraduates
More informationLogic. Facts (with proofs) CHAPTER 1. Definitions
CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies
More informationSolutions to Sample Problems for Midterm
Solutions to Sample Problems for Midterm Problem 1. The dual of a proposition is defined for which contains only,,. It is For a compound proposition that only uses,, as operators, we obtained the dual
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 informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
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 informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
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 informationMath 109 September 1, 2016
Math 109 September 1, 2016 Question 1 Given that the proposition P Q is true. Which of the following must also be true? A. (not P ) or Q. B. (not Q) implies (not P ). C. Q implies P. D. A and B E. A, B,
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
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 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 informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
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 informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationBackground for Discrete Mathematics
Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,
More informationCHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic
CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design
More informationMath 3000 Section 003 Intro to Abstract Math Final Exam
Math 3000 Section 003 Intro to Abstract Math Final Exam Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Name: Problem 1a-j 2 3a-b 4a-b 5a-c 6a-c 7a-b 8a-j
More informationMath Final Exam December 14, 2009 Page 1 of 5
Math 201-803-Final Exam December 14, 2009 Page 1 of 5 (3) 1. Evaluate the expressions: (a) 10 C 4 (b) 10 P 4 (c) 15!4! 3!11! (4) 2. (a) In how many ways can a president, a vice president and a treasurer
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
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 informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More informationFoundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationAN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold
AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH 3034 Jimmy T. Arnold i TABLE OF CONTENTS CHAPTER 1: The Structure of Mathematical Statements.............................1 1.1. Statements..................................................................
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationPreliminaries to the Theory of Computation
Preliminaries to the Theory of Computation 2 In this chapter, we explain mathematical notions, terminologies, and certain methods used in convincing logical arguments that we shall have need of throughout
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
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 informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationMath 2534 Solution to Test 3A Spring 2010
Math 2534 Solution to Test 3A Spring 2010 Problem 1: (10pts) Prove that R is a transitive relation on Z when given that mrpiff m pmod d (ie. d ( m p) ) Solution: The relation R is transitive, if arb and
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 informationBoolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer
More informationHomework 4 Solutions
Homework 4 Solutions ECS 20 (Fall 14) Patrice Koehl koehl@cs.ucdavis.edu November 1, 2017 Exercise 1 Let n be an integer. Give a direct proof, an indirect proof, and a proof by contradiction of the statement
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 informationCSE 20 Discrete Math. Algebraic Rules for Propositional Formulas. Summer, July 11 (Day 2) Number Systems/Computer Arithmetic Predicate Logic
CSE 20 Discrete Math Algebraic Rules for Propositional Formulas Equivalences between propositional formulas (similar to algebraic equivalences): Associative Summer, 2006 July 11 (Day 2) Number Systems/Computer
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 informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
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 informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationYour quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due by 11:59 p.m., Tuesday.
Friday, February 15 Today we will begin Course Notes 3.2: Methods of Proof. Your quiz in recitation on Tuesday will cover 3.1: Arguments and inference. Your also have an online quiz, covering 3.1, due
More informationIntroduction to Quantum Logic. Chris Heunen
Introduction to Quantum Logic Chris Heunen 1 / 28 Overview Boolean algebra Superposition Quantum logic Entanglement Quantum computation 2 / 28 Boolean algebra 3 / 28 Boolean algebra A Boolean algebra is
More informationCS280, Spring 2004: Prelim Solutions
CS280, Spring 2004: Prelim Solutions 1. [3 points] What is the transitive closure of the relation {(1, 2), (2, 3), (3, 1), (3, 4)}? Solution: It is {(1, 2), (2, 3), (3, 1), (3, 4), (1, 1), (2, 2), (3,
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 informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationSection 7.1 Relations and Their Properties. Definition: A binary relation R from a set A to a set B is a subset R A B.
Section 7.1 Relations and Their Properties Definition: A binary relation R from a set A to a set B is a subset R A B. Note: there are no constraints on relations as there are on functions. We have a common
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.
Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth
More informationIntroduction. Foundations of Computing Science. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR
1 Introduction Foundations of Computing Science Pallab Dasgupta Professor, Dept. of Computer Sc & Engg 2 Comments on Alan Turing s Paper "On Computable Numbers, with an Application to the Entscheidungs
More information