Discrete Mathematics
|
|
- Allison Dennis
- 7 years ago
- Views:
Transcription
1 Discrete Mathematics Unit Logic Proofs Short Questions 1. Which of the following sentences are propositions (or statements)? What are the truth values of those that are propositions? (a) What a beautiful solar eclipse? (b) Every triangle is an equilateral triangle. (c) Please, st up. (d) Every quadrilateral is a square. (e) 4 + = 5. (f) 100. (g) Today is Thursday. (h) There is no pollution in Surat. (i) + 1 =. (j) The summer in India is hot sunny.. Define the following terms give the truth tables for each one by considering the propositions p q. (a) Conjunction Disjunction Connectives. (b) Conditional Bi-conditional propositions. (c) Exclusive Or. Define the following by giving an example. (a) Tautology Contradiction. (b) Dual of compound propositions. (c) Tautology implication. 4. When do you say that two compound propositions are logically equivalent? 5. What is the law of duality? 6. Define the following: (a) Disjunction Conjunctive normal forms of a proposition. (b) Truth value of a proposition. (c) Negation of propositions. (d) Converse of propositions. (e) Inverse of propositions. (f) Contrapositive of propositions. (g) Premise. (h) Conclusion. 7. How many rows appear in a truth table for each of these compound propositions? (a) (b) ( ) ( ) (c) (d) ( ) ( ) 8. Write down the duals of the following statements: (a) ( ) [ ] (b) ( ) (c) ( ) ( ) (d) ( ) ( ) 9. Let P(x) denote the statement 4 What are these truth values? (a) P(0) (b) P(4) (c) P(6) 1 Page
2 Discrete Mathematics Let P(x) be the statement =.If the domain consists of the integers, what are the truth values for the following? (a) ( ) (b) ( ) (c) P() Long Questions 1. State prove the following by using Truth Table. (a) Laws of Tautology Contradiction. (b) Commutative Laws. (c) Associative Laws. (d) De-Morgan s Laws. (e) Distributive Laws. (f) Law for Negation of a negation (or involution law) (g) Laws for absorption.. If t c denote tautology contradiction respectively p is a statement then prove. (a) = (b) = (c) (~ ) =. State the Primal Dual forms of the following Laws of Algebra of Propositions: (a) Idempotent Law (b) Identity Law (c) Dominant Law (d) Complement Law (e) Commutative Law (f) Associative Law (g) Distributive Law (h) Absorption Law (i) De-Morgan s Law 4. Prove the following equivalences by using the truth tables. Involving Conditionals: (a) (b) (c) (d) ( ) (e) ( ) (f) ( ) ( ) ( ) (g) ( ) ( ) ( ) (h) ( ) ( ) ( ) (i) ( ) ( ) ( ) Involving Biconditionals: (j) ( ) ( ) (k) (l) ( ) ( ) (m) ( ) 5. State Prove the following Tautological implications using Truth Tables: (a) (b) (c) (d) (e) ( ) (f) ) ( ) (g) ( ) (h) ( ) (i) ( ) Page
3 Discrete Mathematics (j) ( ) ( ) (k) ( ) ( ) ( ) 6. Find the converse, inverse contrapositive of each of these conditional statements. (a) If it snows today, I will ski tomorrow. (b) I come to class whenever there is going to be a quiz. (c) A positive integer is a prime only if it has no divisors other than 1 itself. (d) If it snows tonight, then I will stay at home. (e) I go to the beach whenever it is a sunny summer day. (f) When I stay up late, it is necessary that I sleep until noon. 7. Let P(x) be the statement x spends more than five hours every weekday in class, where the domain for x consists of all students. Express each of these quantifications in English. (a) ( ) (b) ( ) (c) ( ) (d) ( ) 8. What is the negation of each of the following propositions? (a) Today is Thursday (b) There is no pollution in New Jersey. (c) + 1 = (d) The summer in Kutch is hot sunny. 9. Let p, q, r be the propositions p: Grizzly bears have been seen in the area. q: Hiking is safe on the trail. r : Berries are ripe along the trail. Write these propositions using p, q, r logical connectives. (a) Berries are ripe along the trail, but grizzly bears have not been seen in the area. (b) Grizzly bears have not been seen in the area hiking on the trail is safe, but berries are ripe along the trail. (c) If berries are ripe along the trail, hiking is safe if only if grizzly bears have not been seen in the area. (d) It is not safe to hike on the trail, but grizzly bears have not been seen in the area the berries along the trail are ripe. (e)for hiking on the trail to be safe, it is necessary but not sufficient that berries not be ripe along the trail for grizzly bears not to have been seen in the area. (f) Hiking is not safe on the trail whenever grizzly bears have been seen in the area berries are ripe along the trail. 10. Find the bitwise OR, bitwise AND bitwise XOR of each of the following pairs of bit strings: (a) , (b) , (c) , Without using the truth table proves that ( ) ( ) is tautology. 1. Show that the following statements are equivalent: p:good food is not cheap. q:cheap food is not good. 1. Use the method of contraposition prove that, for any integer >, n is prime is odd. 14. Use the method of contradiction, prove that is not a rational number. True or False 1. If P(x) is true for all values of x in the universe of discourse is denoted by (x)p(x).. The truth value of (~ ) is tautology.. Let P(x) denotes the statement 4 then truth value of P(4) is F (false). 4. is equivalently written as ~. Page
4 Discrete Mathematics Unit- Basic Structures Short Questions 1. Define the following: (a) Set (b) Universal Set (c) Null Set (d) Singleton Set (e) Finite Set (f) Infinite Set (g) Cardinality or size of a set. (h) Subset of a set. (i) Superset (j) Proper Subset (k) Equal Sets. (l) Power Set (m) Ordered Pairs (n) Cartesian Product. (o) Union of two Sets. (p) Intersection of two Sets (q) Disjoint Sets. (r) Complement of a Set (s) Difference of a Set (t) Symmetric difference. Let A= {a, b,{c, d}, e}. How many elements does A contain?. Let S= {1,, } How many subsets does S contain? Which are they? S 4. Let S = {a, b}. How many elements does the power set contain? 5. Find the values of x y if the ordered pairs (x + y, 1) (7, x - y) are equal. 6. Suppose sets A, B C have, 4 elements respectively. How many elements are there in A B C? 7. Let D = {1, }, E = {, } F = {4, 5}. How many elements are there in (D E) F? Which are they? 8. From which sets does the Cartesian product {(, ); (, 4)} come from? 9. Explain the Roster notation set builder notation of sets with examples. 10. Define null set singleton set. 11. Define finite infinite sets. 1. What is cardinality of a set? 1. Define subset proper subset. 14. When are two sets said to be equal? 15. What is a power set? 16. State the relation between the cardinalities of a finite set its power set. 17. Define the Cartesian product of two sets give an example. 18. Define union intersection of two sets. Give their Venn diagram representation. 19. When are two sets said to be disjoint? 0. Define complement of a set. Give examples. 1. Define the symmetric difference of two sets.. What is the cardinality of a null set a singleton set? 4 Page
5 01 Discrete Mathematics If A = {a, b, c} B = {1, } then find A B B A. 4. Find the symmetric difference of {1,, 5} {1,, }? 5. How many different elements does A B have if A has m elements B has n elements? 6. Determine whether the sets are equal or not by giving appropriate reason. 7. What is the difference between proper improper subset? 8. What is the power set of empty set? 9. Find the symmetric difference of {,, 7 } {1, 9, }? 0. How many different elements does P(A) have if A has m elements? 1. For any sets A B, Is A B = B A. Justify your answer.. State the difference between Union Intersection of two sets.. If A= {1,, 5, 8} then find the Power sets of (i) A (ii). 4. How many different elements do B A have if A has elements B has 4 elements? 5. Let R be the set of real numbers let the function f : R R be defined by Then, find the values of f(5) f (6). 6. Let A = {Mary, Jane, Ann} B = {Pizza, Lasagne}. How many different functions are there from A into B? 7. The following diagram defines the function f, which maps the set {a, b, c, d, e} into itself. How many elements does the range of f contain? 8. Let the functions f, g, h be defined by, f(x) = x where x R, g (y) = y where < y < 9, h (z) = z where 1 < z < 10.Which of these functions are equal? 9. Let the functions f : R R g : R R be defined by f(x) = x; g(x) = Find the composition function, if exists, 40. Let the functions f : R R be defined by f (x) = x. Find f (7). 41. Define the following terms: (a) Domain of a function (b) Co-domain of a function (c) Range of a function (d) Function (e) Injective (One-one) function. (f) Surjective function (Onto) function. (g) Bijective function. (h) Transcendental functions (i) Algebraic functions (j) Polynomial functions (k) Rational functions (l) Irrational functions (m) Identity function (n) Floor function (o) Ceiling function (p) Integer-value function (q) Absolute value function (r) Remainder function (s) Composition of functions (t) Inverse of a function. 4. Give an example of a function, which is (a) Neither one-to-one nor onto. (b) One-to-one but not onto. (c) Onto but not one-to-one. 5 Page
6 01 Discrete Mathematics (d) One-to-one onto. 4. Show that the function given by is onto but not one-to-one. 44. Show that the function given by is onto but not one-to- one. 45. Check by giving reasons, whether the following are functions or not? (a) (b) (c) 46. Find the values of the following: (a) (b) (c). 47. State the difference between a geometric progression an arithmetic progression. 48. What are the values of these sums? 49. What are values of these sums, where S = {1,, 5, 7} 50. Compute each of these double sums. 51. What are the values of the following products? 5. Find the formula of the sequence with the first 10 terms is 5,11,17,,9,,41,47,5, Define the following terms: (a) Sequence (b) Geometric Progression (c) Arithmetic Progression (d) Permutation (e) Combination 54. State the Sum rule in Counting Principle. 55. State the Product rule in Counting Principle. 56. A new company with just two employees, A B, rents a floor of a building with 1 offices. How many ways are there to assign different offices to these two employees? 57. The chairs of an auditorium are to be labeled with a letter a positive integer not exceeding 100. What is the largest number of chairs that can be labeled differently? 58. What are the different circular arrangements of n objects? 59. There are microcomputers in a computer center. Each microcomputer has 4 ports. How many different ports to a microcomputer in the center are there? 60. How many different bit strings of length seven are there? 61. How many bit strings of length eight either start with a 1 bit or end with the two bits 00? 6. State the Pigeonhole Principle. 6. Among any group of 67 people, how many of them be at-least with the same birth-date? 64. In any group of 7 English words, how many must be at-least begin with the same letter? 65. List all the permutations of {a, b, c}. 66. How many different permutations are there of the set {a, b, c, d, e, f, g}? 67. How many permutations of {a, b, c, d, e, f, g} end with a? 68. Find the value of each of these quantities. (a) P(6, ); (b) P(6, 5); (c) P(8, 1); (d) P(8, 5); (e) P(8, 8); (f) P(10, 9). 69. Find the value of each of these quantities: (a) C(5, 1); (b) C(5, ); (c) C(8, 4); (d) C(8, 8); (e) C(8, 0); (f) C(1, 6) 70. Define a Countable Set. 71. When can we say that two sets have the same cardinality? 6 Page
7 Discrete Mathematics Long Questions 1. Let U = {1,,,..., 8, 9}, B = {1,, 5, 7} C = {,, 4, 5, 6}. How many elements does the sets ( ), ( ) contains? Also find the elements.. Given that U = {1,,,.,9,10}, A = {1,,,4,5}, B = {1,,4,8}, C = {1,,,5,7} D = {,4,6,8}, find each of the following: a) ( ) b) ( ) c) d) ( ) e) ( ) f) ( ) g) ( ) h) ( ) i) ( ) ( ) j) ( ) ( ) k) ( ) l) ( ). State the following algebraic laws of set theory with an example. Also, prove them analytically graphically. a) Identity law b) Domination law c) Idempotent law d) Inverse law e) Commutative law f) Associative law g) Distributive law h) De Morgan s law i) The principle of duality j) Absorption Law. 4. For any sets, A, B C, Prove that both analytically graphically that, (a) ( ) ( ) = (b) ( ) = ( ) ( ) (c) ( ) = ( ) ( ) (d) ( ( )) = ( ) 5. If A, B C are sets, prove analytically that ( ) = ( ) ( ) 6. If A, B, C D are sets, prove analytically that ( ) ( ) = ( ) ( ) 7. Verify De-Morgan s law = in set theory by using Venn diagram. If U=, A={1,,,4,5}, B={1,,4,8}, C={1,,,5,7} D={,4,6,8}, then find: (i) ( ( ) ) (ii) ( ) ( ). 8. If A = {1,, 5}, B = {6, 8, 10} then find the cardinality of the sets (a) (b) 9. Verify analytically ad graphically for sets A, B C ( ) =( ) ( ) 10. Construct the membership table to verify ( ) = for sets A B. 11. If U={x/x N, 1 x 10}, A={1,,,4,5}, B={1,,4,8}, C={1,,,5,7} D={,4,6,8}, then find: (i) ( ( ) ) (ii) ( ) ( ). 1. Verify analytically graphically for sets A, B C, ( ) =( ) ( ) 1. Construct the membership table to verify ( ) = ( ) for sets A, B C. 14. If U={x/x N, 1 x 10}, A={1,,,4,5}, B={1,,4,8}, C={1,,,5,7} D={,4,6,8}, then find: 7 Page
8 01 Discrete Mathematics (i) (ii). 15. Check whether the functions are bijective or not? (a), (b) 16. If A = {1,, } are functions from A to A given by find if exists, (i) ; (ii) ; (iii). 17. If is given by (a), find inverse of in each case. 18. If are defined by Show that are inverses of each other. 19. If S={1,,, 4} are defined by,, find if exists (a) (b) (c) (d) 0. Determine whether each of the following functions is an injective / or surjective function. (a), defined by (b) defined by (c) defined by 1. If A = {1,,, 4, 5}, B = {1,,, 8, 9} the functions are defined by find if exists.. If S={1,,, 4, 5} if the functions are given by,, (a) Verify whether (b) Explain why (c) Find. (d) Show that. If have inverses but are defined by doesnot., find check if they are equal. 4. Determine whether the function defined by is bijective or not. 5. Determine whether the function defined by is bijective or not. 6. Determine whether the function defined by is invertible or not. 7. Determine whether the function defined by is bijective or not. 8. Determine whether the function defined by is invertible or not. 9. If for, where R is the set of real numbers; prove that (a) (b) (c) (d). 0. Let A = {1,, } let f g be functions of A into A. Let f g be the set of points displayed in the first second diagram respectively. Find the value of f(g(1)). 1. If there are mathematics majors 5 computer science majors at a college, then find (a) How many ways are there to pick two representatives so that one is mathematics major the other is a computer science major? (b) How many ways are there to pick one representative who is either a mathematics major or a computer science major?. A multiple choice test contains 10 questions. There are five possible answers for each question. 8 Page
9 Discrete Mathematics (a) How many ways can a student answer the questions on the test if the student answers every question? (b) How many ways can a student answer the questions on the test if the student can leave answers blank?. By using Counting Principle, find the value of k after the following code has been executed. K = 0; For i1 = 1:5 For i = 1:4 For i = 1: For i4 = 1: K = k + 1; End; End; End; End; 4. By using Counting Principle, find the value of k after the following code has been executed. K = 0; For i1 = 1:5 K = k + 1; End; For i = 1:4 K = k + 1; End; For i = 1: K = k+1; End; For i4 = 1: K=k+1 End; 5. Prove that If a r are real numbers r 0, then 6. Assuming that repetitions are not permitted, (a) How many four digit numbers can be formed from the six digits 1,,, 5, 6 8? (b) How many of these numbers are less than 4000? (c) How many of the numbers in part (a) are even? (d) How many of the numbers in part (a) are odd? (e) How many of the numbers in part (a) are multiples of 5? (f) How many of the numbers in part (a) contain both the digits (a) In how many ways can 6 boys 4 girls sit in a row? (b) In how many ways can they sit in a row if the boys are to sit together the girls are to sit together? (c) In how many ways can they sit in a row if the girls are to sit together? (d) In how many ways can they sit in a row if just the girls are to sit together? 8. Suppose that either a member of the mathematics faculty or a student who is a mathematics major is chosen as a representative to a university committee. How many different choices are there for this representative if there are 7 members of the mathematics faculty 8 mathematics majors no one is both a faculty member a student? 9. A student can choose a computer project from one of three lists. The three lists contain, 15, 19 possible projects, respectively. No project is on more than one list. How many possible projects are there to choose from? 40. An office building contains 7 floors has 7 offices on each floor. How many offices are in the building? 41. In how many ways can we select three students from a group of five students to st in line for a picture? In how many ways can we arrange all five of these students in a line for a picture? 9 Page
10 Discrete Mathematics How many ways are there to select a first prize winner, a second prize winner, a third prize winner from 100 different people who have entered a contest? 4. Suppose that there are eight runners in a race. The winner receives a gold medal, the second place finisher receives a silver medal, the third place finisher receives a bronze medal. How many different ways are there to award these medals, if all possible outcomes of the race can occur there are no ties? 44. Suppose that a saleswoman has to visit eight different cities. She must begin her trip in a Specified city, but she can visit the other seven cities in any order she wishes. How many possible orders can the saleswoman use when visiting these cities? 45. How many poker hs of five cards can be dealt from a stard deck of 5 cards? Also, how many ways are there to select 47 cards from a stard deck of 5 cards? 46. A group of 0 people have been trained as astronauts to go on the first mission to Mars. How many ways are there to select a crew of six people to go on this mission (assuming that all crew members have the same job)? 47. Suppose that there are 9 faculty members in the mathematics department 11 in the Computer science department. How many ways are there to select a committee to develop a discrete mathematics course at a school if the committee is to consist of three faculty members from the mathematics department four from the computer science department? 48. How many positive integers n can be formed using the digits, 4, 4, 5, 5, 6, 7, if n has to exceed 50,00,000? 49. How many bit strings of length 10 contain (a) exactly four 1 s, (b) at-most four 1 s (c) at least four 1 s (d) an equal number of 0 s 1 s? 50. How many permutations of letters A B C D E F G contain (a) the string BCD, (b) the CFGA string, (c) the strings BA GF, (d) the strings ABC DE, (e) the strings ABC CDE, (f) the strings CBA BED? 51. If 6 people A, B, C, D, E, F are seated about a round table, how many different circular arrangements are possible, if arrangements are considered the same when one can be obtained from the other by rotation? If A, B, C are females the others are males, in how many arrangements do the genders alternate? 5. From a club consisting of a men 7 women, in how many ways can we select a committee of: (a) men 4 women? (b) 4 persons which has at-least one woman? (c) 4 persons that has at-most one man? (d) 4 persons that has persons of both genders? (e) 4 persons that so that two specific members are not included? 5. In how many ways can 0 students out of 0 be selected for an extra-curricular activity, if (a) Rama refuses to be selected? (b) Raja insists on being selected? (c) Gopal Govind insist on being selected? (d) Either Gopal or Govind or both get selected? (e) Just one of Gopal Govind gets selected? (f) Rama Raja refuse to be selected together? balls are to be placed in boxes. Each can hold all the 5 balls. In how many different ways can we place the balls so that no box is left empty, if (a) Balls boxes are different? (b) Balls are identical boxes are different? (c) Balls are different boxes are identical? (d) Balls as well as boxes are identical? 55. Show that the set of odd positive integers is a countable set. 56. Show that the set of all integers is countable. 57. Show that the set of positive rational numbers is countable. 58. Show that the set of real numbers is an uncountable set. 10 P a g e
11 Discrete Mathematics Multiple Choice Questions 1. Let A = {, {4, 5}, 4}. Which statement is correct? (a) 5 is an element of A. (b) {5} is an element of A. (c) {4, 5} is an element of A. (d) {5} is a subset of A..Which of these sets is finite? (a) {x x is even} (b) {x x < 5} (c) {1,,,...} (d) {1,,,...,999,1000}. Which of these sets is not a null set? (a) A = {x 6x = 4 x = 1} (b) B = {x x + 10 = 10} (c) C = {x x is a man older than 00 years} (d) D = {x x < x} 4. Let D E. Suppose Which of the following statements must be true? (a) c D (b) b D (c) a E (d) a D S 5. Which set S does the power set = {, {1}, {}, {}, {1, }, {1, }, {, }, {1,, }} come from? (a) {{1},{},{}} (b) {1,, } (c) {{1, }, {, }, {1, }} (d) {{1,, }} 6. Let A = {x, y, z}, B = {v, w, x}. Which of the following statements is correct? (a) A B = {v, w, x, y, z} (b) A B = {v, w, y, z} (c) A B = {v, w, x, y} (d) A B = {x, w, x, y, z} 7. Let A = {1,,,..., 8, 9} B = {, 5, 7, 9}. Which of the following statements is correct? (a) A B = {, 4, 6} (b) A B = {1,,, 4, 5, 6, 7, 8, 9} (c) A B = {1,, 4, 6, 8} (d) A B = {, 5, 7, 9} 8. Let C = {1,,, 4} D = {1,, 5, 7, 9}. How many elements does the set C D contain? How many elements does the set C D contain? 9. Let A = {,, 4}, B = {} C = {x x is even}. Which statement is correct? (a) C A = B (b) C B = A (c) A C (d) C / A = B 10. Let A B, B C D A = C. Which statement is always false? (a) B D (b) A C (c) A = B (d) B D = B A 11. What is shaded in the Venn diagram below? (a) A B (b) A (c) A (d) B 1. What is shaded in the Venn diagram below? B (a) A B (b) A' (c) A B (d) B - A 1. Let U = {1,,,..., 8, 9} A = {1,, 5, 7}. Find A'. (a) A' = {, 4, 6, 8} b) A' = {, 4, 6, 8, 9} (c) A' = {, 4, 6} (d) A' = {9} 11 P a g e
12 01 Discrete Mathematics Find the ordered pairs corresponding to the points A B, which appear in the coordinate diagram {1,, } {1,, } below. (a) A = (, 1), B = (1, ) (b) A = (1, ), B = (, 1) (c) A = (, 1), B = (1, ) (d) A = (, ), B = (, ) 15. Let A = {1,, }. Which of the following diagrams of A A is a function from A into A? (d) None of them. 16. Which of the diagrams defines a function of A = {a, b, c, d} into B = {1,, } (a) (b) (c) (d) 17. Let f 1, f, f, f 4, f 5 be functions of R into R let f 1(x) = x + x - 4. Which of these functions are equal to f 1? (a) f (x) = x (b) f (y) = y 4 (c) f 4(z) = z + z - 4 (d) f 5(x) = x + x 18. Which of the following functions is one-one? (a) To each show assign its first performance. (b) To each student assign his mentor. (c) To each pair of shoes assign its price. (d) To each school assign the number of computers it has. 19. Let A = {1,,, 4}. Let f, g h be functions of A into R. Which one of them is one-one? (a) f(1) =, f() = 4, f() = 5, f(4) = (b) g(1) =, g() = 4, g() = 5, g(4) = (c) h(1) =, h() =4, h() =, h(4) = (d) None of above 0. Let A = [, 1]. Which of these functions are bijective on A? 4 (a) f(x) = x (b) g (x) = x (c) h(x) = x (d) None of above 1. Let S = {a, b, c, d}. Which of the following sets of ordered pairs is a function of S into S? (a) {(a, b), (c, a), (b, d), (d, c), (c, a)} (b) {(a, c), (b, c), (d, a), (c, b), (b, d)} (c) {(a, c), (b, d), (d, b)} (d) {(d, b), (c, a), (b, e), a, c)}. Let R be the set of real numbers let the function f : R R be defined by f(x) = x -. Which ordered pair belongs to the graph f * of the function f? (a) (5, 6) (b) (, ) (c) (5, ) (d) (4, 1) True or False 1. If A is not a sub-set of B, then at least one element of A does-not belong to B. 1 P a g e
13 Discrete Mathematics Every set is a sub-set of itself.. If A is a subset of B, then is called the superset of A. 4. If S = {a, b, c}, then P(S) = The ordered pairs (a, b) (c, d) are equal, if only if a = b c = d. 6. A B is always equal to B A. 7. {, 6, 8} = {8,, 6} 8. {0} {0} 9. {(1, ), (, )} = {(, 1), (, )} 10. {5, 7, 8} = {8, 7, 5} 11. Trigonometric, exponential Logarithmic functions are Transcendental functions. 1. Identity function is always a bijective function = (mod 7) =. 15. The inverse of a function f, if exists, is always unique. Fill In the Blanks 1. is a subset of every set.. If A B B C, then A C.. If A = {a, b}, B = {a, b, c} C = {b, c, a} then A is a subset of C B is a subset of C. 4. Two sets A B are equal if,. 5. For any set S, if S = n then P(S) =. 6. For proving the algebraic laws of set theory, if we use definitions of sets, that method is called method if we use Venn diagram, then that method is called method. 7. A (B C) =. 8. Let f(x) = x. Then, the value of (5) =. 9. For any x set A, the function f: A A, f(x) = x is called the function on A. 10. A function of the form 4 ( ) ( ), where f(x) g(x) 0 are polynomials is called Function. 11. If f(x) = x x + x -4 is a function in x of degree =. 1. (mod 5) =. 14. ( ) =. Unit- Relations Short Questions 1. Determine whether or not each of the following relations is a function with domain {1,,, 4}.If any relation is not a function, explain why? (a) R1 = {(1, 1), (, 1), (, 1), (4, 1), (, )} (b) R = {(1, ), (, ), (4, )} (c) R = {(1, 1), (, 1), (, 1), (4, 1)} (d) R4 = {(1, 4), (, ), (, ), (4, 1)}. Determine whether or not each of the following relations is a function If any relation is a function, find its range. (a) R1 = {(x, y)/x, y Z, y = x + 7}, which is a relation from Z to Z. 1 P a g e
14 Discrete Mathematics (b) R = {(x, y)/x, y R, y = x}, which is a relation from R to R. (c) R = {(x, y)/x, y R, y = x + 1}, which is a relation from R to R. (d) R4 = {(x, y)/x, y Q, x + y = 1}, which is a relation from Q to Q.. Define the following: (a) Relation. b) Binary relation. (c) Domain of a relation. (d) Range of a relation. (e) Universal relation. (f) Void relation. (g) Identity relation. (h) Inverse of a relation (i) Intersection of two relations. (j) Union of two relations. (k) Difference of two relations. (l) Complement of a relation. (m) Reflexive property of a relation (n) Symmetric property of a relation (o) Anti-symmetric property of a relation. (p) Transitive property of a relation. (q) Equivalence relation. (r) Partial Order relation. (s) Poset. (t) Irreflexive relation. (u) Nodes or vertices in a graph. (v) Arcs or edges in a graph. (w) Directed graph or Diagraph of a relation. (x) Hasse Diagram. (y) n-array relation. (z) Composition of relation 4. If A = {,, 5} B = {6, 8, 10} arb if only if a A divides b B, then find R, R, D(R), D(R ), R(R) R(R ). 5. State an example of a relation for the following which satisfies: (a) Reflexive Property. (b) Symmetric property. (c) Anti-symmetric property (d) Transitive property (e) Equivalence relation property (f) Partial Order relation property (g) Irreflexive relation property (h) Non symmetric property (not symmetric) (i) Non anti-symmetric property (not anti-symmetric) (j) Non Transitive property (not transitive) (k) an n-array relation. 6. State the difference between an Equivalence relation a partial order relation. 7. State the difference between a set a Poset. 8. State an example of a Partially ordered set. 9. List the ordered pairs in the relation R from A = {0, 1,,, 4} to B = {0, 1,, }, where (a, b) R if only if : (i) a = b; (ii) a + b = 4; (iii) a > b; (iv) a/b (a divides b); (v) gcd(a, b) = 1; (vi) lcm(a, b) = 10. The relation R on the set A = {1,,, 4, 5} is defined by the rule (a, b) R, if divides a-b. (i) List the elements of R, R complement of R. (ii) Find the domain range of R R. 14 P a g e
15 Discrete Mathematics If R be a relation on Z Z Z consisting of triples (a, b, c), where a, b, c are integers with a b c. Is (-,, 7) (,, ) belongs to relation R or not? 1. Let R be the relation on set {1,,, 4} containing the ordered pairs {(1, 1), (1, ), (, 1), (, ), (, ), (, ), (4, 1), (4, 4)}. Find the reflexive closure Symmetric closure of R. 1. If R is the relation of A = {1,,,4} such that (a,b) R, if only if a + b = even, Find the relational matrix MR. 14. If R be a relation defined as, R = {(a, b)/a b} on the set {1,,, 4, 5, 6}. Find R. 15. If R be a relation defined as, R = {(a, b)/ a divides b} on the set {1,,, 4, 5, 6}. Find R. 16. If R be a relation on Z Z Z consisting of triples (a, b, c), where a, b, c are integers with a > b > c. Is (-,, 7) (, 4, 5) belongs to relation R or not? 17. Two sets E = {, 4, 5, 6} F = {1,, 6}. Let R be a relation from E to F, defined by " greater than " relation. How many elements does the solution set of R contains? 18. If R is the relation from A = {1,,,4} to B = {,,4,5}, list the element in R defined by arb, if a b are both odd. Write also the domain range of R. 19. If R is a relation from A = {1,,} to B = {4,5} given by R = {(1,4), (,4), (1,5), (,5)}. Then, find R (the inverse of R) R (the complement of R). 0. If R = {(1,1), (,), (,)} S = {(1,1), (1,), (1,), (1,4)} find R S. 1. Give an example of a relation that is both symmetric antisymmetric.. Give an examples of a relation that is neither symmetric nor antisymmetric.. Give an example of a relation that is reflexive transitive but not symmetric. 4. Give an example of a relation that is symmetric transitive but not reflexive. Long Questions 1. State the types of relations with an appropriate example of each one.. Let A = {x, y, z}, B = {1,, }, C = {x, y} D = {, }. Let be the relation from A to B defined by R = {(x, 1), (x, ), (y, )} Let S be the relation from C to D defined by S = {(x, ), (x, )}. Then, find R-S, R S, R S, R.. State the properties of relations with an appropriate example of each one. 4. Check whether the greater than or equal to ( ) relation is a partially ordered set or not in set of integer Z. 5. Construct a diagraph representing the relation R R on the set A = {,, 4, 6}, defined barb if a divides b, for every a, b A. 6. State the three steps to reduce a diagraph into a Hasse diagram. 7. Construct a diagraph hence, Hasse diagram representing the relation R on the set A = {1,,, 4}, defined by arb if a b, for every a, b A. 8. If R = {(1, ), (, 4), (, )} S = {(1, ), (, 4), (4, )}. Find the following: (i) R S; (ii) R S; (iii) R-S; (iv) S-R; (v) R S. Also, verify that, dom(r S) = dom(r) dom(s) range (R S) range(s). 9. Determine whether the relation R on the set of all integers is reflexive, symmetric, anti-symmetric or transitive or not, where arb if only if (i) a b; (ii) ab 0; (iii) ab 1; (iv) a is a multiple of b. (v) a - b = 1 ; (vi) a = b ; (vii) a b. 10. Which of the following relations on set {0, 1,, } are equivalence relations? Explain with appropriate reason. (i) R1 = {(0, 0), (1, 1), (, ), (, ) } (ii) R = {(0, 0), (0, ), (, 0), (, ), (, ), (, ), (, )} (iii) R = {(0, 0), (1, 1), (1, ), (, 1), (, ), (, )} (iv) R4 = {(0, 0), (1, 1), (1, ), (, ), (, ), (, 1), (, ), (, )} (v) R5 = {(0, 0), (0, 1), (0, ), (1, 0), (1, 1), (1, ), (, 0), (, ), (, )} 11. Construct a diagraph hence, Hasse diagram representing the relation R on the set A = {0, 1,,, 4}, defined by arb if, a b for every a, b A. 15 P a g e
16 Discrete Mathematics Construct a diagraph hence, Hasse diagram representing the relation R on the set A = {1,,,4,5,6,7,8} defined by arb if, a b for every a, b A. 1. Prove that the relation of set inclusion is a partial ordering on any collection of sets. 14. Construct a diagraph hence, Hasse diagram representing the relation R on the set A = {1,, 6, 7, 8, 9}, defined by arb if, a b for every a, b A. Also, by diagraph, check whether, the given relation is a partial order relation or not? Determine whether the relation represented by the zero-one matrix is an equivalence relation or not? 16. Define a relation on a set. Find the transitive closure of the relation R = {(1, 1), (1, ), (, 1), (, ), (, ), (, 1), (, )} on {1,, }. 17. Let R be the relation on the set {0, 1,, } containing the ordered pairs (0, 1), (1, 1),(1, ), (, 0) (, ) (, 0). Find the reflexive closure symmetric closure of R. 18. Find the matrix representing the relations SoR, where the matrices representing R S are MR = MS = Determine whether the relation represented by the zero-one matrix is an equivalence relation or not? 0. Construct a diagraph hence, Hasse diagram representing the relation on the set A = {1,, 4, 5, 6, 7}, defined by greater than or equal to relation. Also, by diagraph, Check whether, the given relation is a partial order relation or not? 1. Define a void relation on a set. Find the transitive closure of the relation R = {(1, 1), (1, ), (, 1), (, ), (, ), (, 1), (, ) } on {1,,}.. Define an Equivalence relation. Check whether the relation R on the set of all integers defined by arb if only if a b is an Equivalence relation or not? Multiple Choice Questions: 1. If the relation on a set is called a void relation if (a) R = A B (b) R = Ø (c) R = {(a, a) / a A} (d) R = R (e) None of above. If A = {1,, }, then R = {(1, 1), (, ), (, )} is the relation on A. (a) Void (b) Inverse (c) Identity (d) Universal (e) None of above. If R S denote two relations, then R-S is defined as, (a) ( ) = ~ ~ (b) ( ) = ~ (c) ( ) = ~ (d) ( ) = ~ ~ (e) None of above 4. To reduce a diagraph into a Hasse diagram, it satisfies (a) Since the partial ordering is a reflexive relation, its diagraph has loops at all the vertices. We need not show loops since they must be present. (b) Since, the partial ordering is a transitive, we need not show those edges that must be present due to transitivity (c) If we assume that all edges are directed upward, we need not show the directions of the edges. (d) All of above. (e) None of above. 16 P a g e
17 Discrete Mathematics The relation R is given by the set of ordered pairs, R = {(, 4), (, 4), (1, ), (, 5), (, )}. Which of the following is the domain of R? (a) {,, 1, 5} (b) {1,, } (c) {1,,, 4, 5} (d) {, 4,, 5} 6. The relation R is given by the set of ordered pairs, R = {(, 4), (, 4), (1, ), (, 5), (, )}. Which of the following is the range of R? (a) {, 4, 5} (b) {1,, } (c) {1,,, 4, 5} (d) {4, 4,, 5} 7. Find the inverse of the relation R = {(, 4), (, 4), (1,), (, 5), (, )}. (a) {(, 4), (, 4), (1, ), (, 5), (, )} (b) {(4, ), (4, ), (, 1), (5, ), (, )} (c) {5, 4,,, 1} (d) {(4, 4), (, ), (1, 1), (5, 5), (, )} 8. Which one of the following open sentences defines a reflexive relation on the set of natural numbers? (a) "x is less than y" (b) "x = y" (c) "x - y = 5" (d) "x divides y" 9. Find the reflexive relation on the set A if A = {a, b, c}. (a) R1 = {(a, b), (b, c), (a, a), (c, c)} (b) R = {(a, a), (b, c), (c, c)} (c) R = {(a, a), (a, c), (c, a), (b, b), (c, c)} (d) R4 = {(a, a), (c, c), (a, c), (c, a)} 10. Which one of the following open sentences defines a symmetric relation in the set of natural numbers N? (a) "x is less than y" (b) "xy = 1" (c) "x - y = 5" (d) "x divides y" 11. Find non-symetric relation on the set B = {c, d, e}. (a) R1 = {(e, e)} (b) R = {(e, e),(c, d), (d, c)} (c) R = B x B (d)r4 = {(c, d), (d, d), (d, e)} 1. Find the anti-symmetric relation on the set B = {1,, }. (a) R1 = {(, )} (b) R = {(1, ), (1, 1), (1, ), (, 1)} (c) R = B B (d) R4 = {(1, ), (, ), (, ), (, )} 1. Let C = {1,,, 4} let R1, R, R, R4 be the relations in C. Which one of them is transitive? (a) R1 = {(, ), (, ), (, ), (1, 1)} (b) R = {(1, 1), (, ), (1, ), (, )} (c) R = {(, 4), (, ), (4, 4), (4, )} (d) R4 = {(1, ), (, ), (, ), (, )} 14. Find the transitive relation in the set D = {1,,, 4}. (a) R1 = {(1, ), (4, ), (, ), (, 4)} (b) R = {(1, 4), (4, ), (1, 1), (, )} (c) R = {(, ), (, 4), (4, 4), (4, )} (d) R4 = {(, 1), (, 4), (4, ), (, 4)} 17 P a g e
18 Discrete Mathematics Unit-4 Matrices Short Questions 1. Define the following terms: a) Matrix b) Diagonal matrix c) Equal matrices d) Transpose of a matrix e) Row matrix f) Column matrix g) Null matrix h) Square matrix i) Symmetric matrix k) Skew-symmetric matrix l) Unit matrix OR identity matrix m) Determinant of square matrix. If A is a matrix of order p q B is a matrix of order q r, then what is the order of the product of matrix AB?. What is the necessary condition for the addition of two matrices? 4. What is the necessary condition for the multiplication of two matrices? 5. Every identity matrix is a diagonal matrix True or False? Justify your answer. 6. State the difference between a matrix a determinant If A = B =, find B A If Q = [ 1] S =, find QS. 9. If B =, find BT Find ad-joint of the following matrices: a) b) Find inverse of the following matrices: a) b) c) Long Questions 1. Find the elements a1, a, a, a from the following matrices: 18 P a g e
19 Discrete Mathematics The following matrices are of special types. Indicate their types also give their orders.. If possible, find A + 5B; A 4C; B + C -D; A + C; B D. 4. If A = ; B = A; C = B + A 5I (where I is an Identity matrix of order );find the matrix such that D = A + B C. T 5. If A = ; find the matrix B such that A + B = O; where O is the null matrix. 6. Find A + B C mention the type of the matrix obtained. 7. Find AB BA for the given matrices, 8. If A = ;B= 9. If A = ;C= ; B= Prove that A (BC) = (AB) C. ;C= Prove that: i. AB = BA = O (Null matrix) ii. AC = A iii.ca = C 10. If A = ; B= ; Find AB. 19 P a g e
20 Discrete Mathematics If A = Prove that A = I ; (where I is an Identity matrix of order ). 1. Prove that A = satisfies the following equation: A 4A - 5 I = O (where O is a null matrix of order I is an Identity matrix of order ). 1. If A = T B = find AB BB. 14. If A = ;B=. Prove that (A + B) = A + B. 15. If A = ;B= (A + B) = A + B, find x y. 16. Find the transpose of matrices A B; 17. If A= ;B=, Verify that, T T T i. (A + B) = A + B T T T ii. (AB) = B A 18. Find ad-joint of the following matrices: a) ; b) ; c) ; d) 19. Find inverse of the following matrices: 0. Examine whether the following matrices are non-singular or not. 1. Find also the inverse of a non-singular matrix. T. If A =, find A + A + A.. If A =,B= 4. If A = AB =, Show that (AB) = B A., find matrix B. 5. Solve the system of equations by Matrix Inversion method. (a) x + y = 7 (b) 5x y = 4x y = 9-6x + y = 4 (c) 5x + 8y + z = (d) 4x -y - z = y + z = -x+4y - z = x + y z = -x - y +5z = 0 0 P a g e
21 Discrete Mathematics Multiple Choice Questions: 4 6, the order of matrix A is 8 5 a) b) c) 1 d) None of the above. If B = 7, which type of the give matrix B? 1 a) Unit matrix b) Row matrix c) Column matrix d) Square matrix 1 4. Mention the type of the matrix A = a) Symmetric matrix b) Skew-symmetric matrix c) Null matrix d) Identity matrix is matrix of the type. 0 1 a) Zero matrix b) Row matrix c) Column matrix d) Unit matrix If A = 0 6 9, the diagonal elements are 7 8 a) 4, 6, 8 b) 4, 0, c), 6, d) All of the above 1. If A = 6. If A = a) ,B= 5 b) then, A B gives c) If B = 4 6 then co-factor of 6 is a) - b) c) 6 d) If A =,B=, the product BA is 1 1 a) b) c) If A =, then find adj A a) b) c) If B =, then the transpose of B is a) b) c) T T 11. If A =, find (A ) a) b) c) 5 1. If A =, then A 5 a) b) c) d) d) None of the above. d) d) d) None of the above. d) 1 P a g e
22 Discrete Mathematics If A = 1 a) I 14. If B = a) B 15. If A = a) , then A = 0 b) I4 c) I 01 d) none of the above then, adj (adj (B) ) gives b) adj (B) 6, then A = 4 b) 1 c) B d) c) 0 d) None of the above P a g e
Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9
Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationDiscrete Mathematics. Hans Cuypers. October 11, 2007
Hans Cuypers October 11, 2007 1 Contents 1. Relations 4 1.1. Binary relations................................ 4 1.2. Equivalence relations............................. 6 1.3. Relations and Directed Graphs.......................
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 E-mail: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationYou know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
More informationAutomata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi
Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the
More information7 Relations and Functions
7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information4. How many integers between 2004 and 4002 are perfect squares?
5 is 0% of what number? What is the value of + 3 4 + 99 00? (alternating signs) 3 A frog is at the bottom of a well 0 feet deep It climbs up 3 feet every day, but slides back feet each night If it started
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationDiscrete Mathematics
Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 16, 2009 2.1 Sets 2.1 Sets 2.1 Sets Basic Notations for Sets For sets, we ll use variables S, T, U,. We can
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationA Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationWOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121
More informationLogic in Computer Science: Logic Gates
Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationBasic Concepts of Set Theory, Functions and Relations
March 1, 2006 p. 1 Basic Concepts of Set Theory, Functions and Relations 1. Basic Concepts of Set Theory...1 1.1. Sets and elements...1 1.2. Specification of sets...2 1.3. Identity and cardinality...3
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationVocabulary Words and Definitions for Algebra
Name: Period: Vocabulary Words and s for Algebra Absolute Value Additive Inverse Algebraic Expression Ascending Order Associative Property Axis of Symmetry Base Binomial Coefficient Combine Like Terms
More informationVocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.
CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationHow To Understand And Solve A Linear Programming Problem
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More informationBookTOC.txt. 1. Functions, Graphs, and Models. Algebra Toolbox. Sets. The Real Numbers. Inequalities and Intervals on the Real Number Line
College Algebra in Context with Applications for the Managerial, Life, and Social Sciences, 3rd Edition Ronald J. Harshbarger, University of South Carolina - Beaufort Lisa S. Yocco, Georgia Southern University
More informationPropositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.
irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
More informationHow To Understand And Solve Algebraic Equations
College Algebra Course Text Barnett, Raymond A., Michael R. Ziegler, and Karl E. Byleen. College Algebra, 8th edition, McGraw-Hill, 2008, ISBN: 978-0-07-286738-1 Course Description This course provides
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationTo define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions
Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions
More informationAlgebra I Vocabulary Cards
Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationCardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.
Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationNotes on Algebraic Structures. Peter J. Cameron
Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the second-year course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester
More informationLecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationBasic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008
Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?
More informationExamples of Functions
Examples of Functions In this document is provided examples of a variety of functions. The purpose is to convince the beginning student that functions are something quite different than polynomial equations.
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More informationSouth Carolina College- and Career-Ready (SCCCR) Pre-Calculus
South Carolina College- and Career-Ready (SCCCR) Pre-Calculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More informationS on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped
More informationClock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationChapter 3. if 2 a i then location: = i. Page 40
Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More informationIntroduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
More informationPRE-CALCULUS GRADE 12
PRE-CALCULUS GRADE 12 [C] Communication Trigonometry General Outcome: Develop trigonometric reasoning. A1. Demonstrate an understanding of angles in standard position, expressed in degrees and radians.
More informationTOPPER Sample Paper - I. Class : XI MATHEMATICS. Questions. Time Allowed : 3 Hrs Maximum Marks: 100
TOPPER Sample Paper - I Class : XI MATHEMATICS Questions Time Allowed : 3 Hrs Maximum Marks: 100 1. All questions are compulsory.. The question paper consist of 9 questions divided into three sections
More informationMath 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationBasics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850
Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationApplied Liberal Arts Mathematics MAT-105-TE
Applied Liberal Arts Mathematics MAT-105-TE This TECEP tests a broad-based overview of mathematics intended for non-math majors and emphasizes problem-solving modeled on real-life applications. Topics
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationALGEBRA 2/TRIGONOMETRY
ALGEBRA /TRIGONOMETRY The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION ALGEBRA /TRIGONOMETRY Tuesday, January 8, 014 1:15 to 4:15 p.m., only Student Name: School Name: The possession
More informationAbstract Algebra Cheat Sheet
Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the
More informationA linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form
Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationMaths class 11 Chapter 7. Permutations and Combinations
1 P a g e Maths class 11 Chapter 7. Permutations and Combinations Fundamental Principles of Counting 1. Multiplication Principle If first operation can be performed in m ways and then a second operation
More information