First Midterm Examination
|
|
- Byron Rice
- 5 years ago
- Views:
Transcription
1 Fall Semester First Midterm Examination 1) 6 students will sit at a round table. Anıl, Sümeyye and Tahsin are in section 1 and Bora, İpek and Efnan are in section 2. They will sit such that nobody is next to someone in his/her own section. In how many different ways can they do that? 2) We have 5 Red, 5 White and 5 Blue chips. We will arrange them in a line, but we want all reds to be on the left of all blues. For example, RRWWRWRRWBBBWBB is acceptable, RRWBWRWRRWBBWBB is not. How many arrangements are there? 3) Let A = {1, 3, 5,...} denote the set of all positive odd integers and B = {2, 4, 6,...} the set of all positive even integers. Are the following statements true or false? Explain! For all m A there exists n B such that m < n. There exists m A such that m < n for all n B. There exists n B such that m < n for all m A. For all m A there exists n B such that n = 4m. 4) Prove that 4 17 n 13 n for all n 1. 5) How many zeroes are there at the end of 128!? Explain. Bonus) Suppose that everyone who is young and healthy is happy. Are the following claims about three different people correct? Explain. a) A is not happy. Therefore A is not young and A is not healthy. b) B is happy. Therefore B is young. c) C is not happy and C is young. Therefore C is not healthy.
2 Answers 1) 2! 3! = 12 2) Place 5 Reds and 5 Blue s. Then, fill the 11 spaces with Whites randomly. This is like distributing 5 identical objects to 11 distinct boxes. ( ) = 15! 5 5! 10! = ) TRUE. (Given any odd number, we can find a larger even number) TRUE. (1 is smaller than any positive even number) FALSE. (There is no even number larger than all odd numbers) TRUE. (Four times an odd number is an even number) 4) Let s use mathematical induction. The statement is correct for n = 1. Suppose it is correct for n = k, in other words 4 17 k 13 k Now consider n = k k+1 13 k+1 = k k = 4 17 k k k k and 4 13 (17 k 13 k ) Therefore k k k In other words 4 17 k+1 13 k+1 Bonus) 5) For a zero, we need 10 = 5 2 as a factor. There are more 2 s than 5 s, in any factorial, so we have to count 5 s. Don t forget that 25 and multiples contain two, 125 contain three 5 s = a) FALSE. A is not young OR A is not healthy. b) FALSE. B may be old. c) TRUE. We can see this by taking the contrapositive of the given statement. Not happy not young OR not healthy.
3 Fall Semester Second Midterm Examination 1) Consider the students in our University. Define a relation between them as follows: If their birthdays (just the day and month) is 5 days or less apart, they are related. For example, suppose you were born on December 3. Then you will be related to people born between November 28 and December 8 (inclusive). You will NOT be related to someone born on January 10, or December 9. a) Is this relation Reflexive? b) Is this relation Symmetric? c) Is this relation Anti - Symmetric? d) Is this relation Transitive? e) Is this relation an Equivalence relation? 2) A very large number of students take an examination. Their grades are integers in the range [0, 100]. We randomly select 2015 groups of students. Each group consists of 5 students. Show that we can always find 5 groups with exactly the same average grade. 3) Determine the number of onto functions from A = {1, 2, 3, 4, 5, 6} to B = {a, b, c, d}. 4) We will form 3 teams from 10 distinct workers. In how many different ways can we do this? (Each team contains at least one worker)
4 5) A group of 7 people find a buried treasure consisting of 40 identical pieces of gold. They will share the gold among themselves according to following constraints: Berke gets even number. Ece gets a multiple of 3. Gizem gets a multiple of 4. Merve gets 0,1 or 2. Sergen gets 0 or 2. Utku gets 0 or 1. Yılmaz gets 0 or 1. In how many different ways can they do this? Bonus) 6 people on an air plane have identical suitcases. On exit, they take one randomly. Aslı and Kardelen make a bet on how many of them will get their own suitcases. Aslı thinks that, nobody will get his/her own suitcase. Kardelen thinks that, exactly one person will get his/her own suitcase. Who is more likely to win?
5 Answers 1) a) YES, everybody is born on the same date with himself/herself. b) YES, if x is related to y, obviously, y is related to x. c) NO (for the same reason) d) NO, if x is related to y and y is related to z, x is not necessarily related to z. For example, their birthdays may be on 5th, 8th and 11th of the month. e) NO, not transitive. 2) Note that the object of interest is the group, not the student. The possible values for group average are: {0, 0.2, 0.4, 0.6,..., 99.6, 99.8, 100.0} There are 501 different possibilities. It is easier to see this if we look at the sum of group s grades, where the possibilities are: {0, 1, 2,..., 499, 500} This makes 501 holes and 2015 pigeons. Therefore there are 2015 = 4.02 = groups with the same average by pigeonhole principle. 3) 4 6 ( ) ( ) ( ) =
6 4) Using Stirling numbers on the table: S(10, 3) = S(9, 2) + 3S(9, 3) = = 9330 OR, we may obtain the same result by inclusion-exclusion: ! = ) The series representing these constraints are: 1 1 x x 3 After cancellations, we obtain: 1 (1 x) = ( ) n + 2 x n 3 n n=0 The coefficient of x 40 is: ( ) 42 = x 4 1 x3 1 x (1 + x2 ) (1 + x) (1 + x) Bonus) The number of different cases where Aslı wins is the derangements of 6: ( ) ( ) ( ) ( ) ( ) ( ) ! 5! + 4! 3! + 2! 1! + 0! = The number of different cases where Kardelen wins is 6 times the derangements of 5: [ ( ) ( ) ( ) ( ) ( ) ] ! 4! + 3! 2! + 1! 0! = 6 44 = So Aslı is more likely to win. (By a very small margin) Probabilities are: 265 6! = for Aslı and 264 6! = for Kardelen. Note that both numbers are approximately equal to e 1 =
7 Fall Semester Final Examination 1) Find two integers p, q such that 64p + 59q = 1. 2) a) Find a function f : Z Z such that f is one-to-one but not onto. b) Find a function g : Z Z such that g is onto but not one-to-one. 3) Elements in a set A may or may not have the properties P, Q, R, S. (For example, A may be a set of integers and P denote divisible by 4 etc.) Are the following logical inferences correct? In other words, does the conclusion follow from assumptions? Explain your reasons. a) If an element has property P, then it has properties Q and R. The element x has property Q. Therefore x also has property R. b) If an element has properties P and Q, then it has property S. The element y has property S. Therefore y also has properties P and Q. c) If an element has properties P, Q and R, then it has property S. The element z has properties P, Q and S. Therefore z also has property R. d) If an element has properties P and R, then it has properties Q and S. The element w has property Q but it does not have the property S. Therefore w does not have the property P or w does not have the property R. 4) We will form a 7-letter sequence using the letters A, B, C. Each letter must appear an odd number of times or zero times. How many possible sequences are there?
8 5) Find the asymptotic complexity of the following algorithm: INPUT: Integer n //A is an n n matrix For i = 1 to n For j = 1 to n A(i, j) = 1/(i + j) EndFor EndFor For i = 1 to n If i is even A(i, i) = 1 Else A(i, i) = 1 EndIf EndFor Return A Bonus) There are 8 chairs in a classroom. 6 students attend a lecture. After the break, the same 6 students come to the same class and choose chairs randomly. How many arrangements are there where exactly 2 students sit on their previous chairs?
9 Answers 1) Using Euclid s algorithm = = = = 0 Therefore gcd(64, 59) = 1. Reverse this process to obtain: 1 = = = So p = 12 and q = 13. 2) Many different solutions are possible. An example is: a) f(n) = 2n { b) g(n) = n/2 if n is even (n + 1)/2 if n is odd 3) a. FALSE. We have no information on R. Example: A: Positive integers, P : multiple of 6, Q: multiple of 2, R: multiple of 3. Obviously, if an integer is multiple of 6, it is multiple of 2 and multiple of 3. But if an integer is multiple of 2, it is not necessarily multiple of 3. b. FALSE. Converse of a true statement is not necessarily true. Example: A: Positive integers, P : multiple of 9, Q: multiple of 4, S: multiple of 6. Obviously, if an integer is multiple of 9 AND 4 then it is a multiple of 6. But if an integer is multiple of 6, it is not necessarily multiple of 9. c. FALSE. We have no information on R. Example: A: Positive integers, P : multiple of 5, Q: multiple of 3, R: multiple of 4, S: multiple of 30. Obviously, if an integer is multiple of 5, 3 AND 4 then it is a multiple of 30. But if an integer is multiple of 5, 3 and 30, it is not necessarily multiple of 4. d. TRUE. (P R) P R
10 4) Order is important we have to use exponential generating functions. (1 + x + x 3 + x 5 ) 3 = (1 + ex e x 2 ) 3 = 4 + 9ex 9e x + 6e 2x + 6e 2x + e 3x e 3x 8 In the Taylor series expansion of this function, the coefficient of the term x7 7! is: 1 ( ) = ) Θ(n 2 ) + Θ(n) = Θ(n 2 ) ( ) 6 Bonus) Choose two students in = 15 different ways. The rest is an inclusion-exclusion problem. 2 We have 4 items and 6 containers. Each container can contain at most 1 item. Item 1 can NOT be placed in container 1 etc. ( ) ( ) ( ) ( ) = So the answer is: = 2715
11 Name-Surname: CLASSWORK 1 We will distribute 40 identical balls to 10 different children such that each child gets at least 2 and at most 20 balls. In how many different ways can we do this? First, give 2 balls to each of the 10 children. Distribute the remaining 20 balls to 10 children randomly. This can be done in ( ) = 20 ( ) different ways. Among these distributions, there are 10 cases where one child gets all 20 (total number of 22) balls and 10 9 = 90 cases where one child gets 19 (total number of 21) balls. So we have to subtract these. ( ) =
12 Name-Surname: CLASSWORK 1 Find the number of integer solutions of the system of inequalities x 1 + x 2 + x 3 + x 4 + x 5 + x 6 + x x 1 + x 2 + x 3 + x 4 + x 5 + x 6 + x 7 0 x i Distributing 25 or fewer items to 7 boxes is equivalent to distributing exactly 25 items to 8 boxes: ( ) = 25 ( ) We want to distribute 15 or more, so we have to subtract the number of distributions where the total is 14 or fewer. Distributing 14 or fewer items to 7 boxes is equivalent to distributing exactly 14 items to 8 boxes: ( ) = 14 ( ) ( ) ( ) 21 =
13 Name-Surname: CLASSWORK 2 Are the following pairs of compound statements logically equivalent or not? Explain. a) x (P (x) Q(x)) and ( x P (x)) ( x Q(x)) b) x (P (x) Q(x)) and ( x P (x)) ( x Q(x)) a) YES they are logically equivalent. The first statement says that both P (x) and Q(x) are correct for all elements in the set. The second statement says exactly the same thing. b) NO they are not logically equivalent. The first statement says there is an element x for which both P (x) and Q(x) are true. The second statement says there are two elements, x 1, x 2 such that P (x 1 ) is true and Q(x 2 ) is true. We do not know if x 1 and x 2 are the same or not. For example, suppose three students are sitting at a table. a. At least one of them has passed both PHYS and MATH courses. b. At least one of them has passed PHYS course and at least one of them has passed MATH course. It is clear that these two statements are not equivalent. 1) may be FALSE while 2) is TRUE.
14 Name-Surname: CLASSWORK 2 Are the following pairs of compound statements logically equivalent or not? Explain. a) x (P (x) Q(x)) and ( x P (x)) ( x Q(x)) b) x (P (x) Q(x)) and ( x P (x)) ( x Q(x)) a) NO they are not logically equivalent. The first statement says P (x) or Q(x) is true for all elements in the set. The second statement says P (x) is true for all elements or Q(x) is true for all elements. For example, suppose three students are sitting at a table. a. All of them have passed at least one of the two courses: PHYS or MATH. b. All of them have passed PHYS course or all of them have passed MATH course. It is clear that these two statements are not equivalent. 1) may be TRUE while 2) is FALSE. b) YES they are logically equivalent. The first statement says that P (x) or Q(x) is correct for some element in the set. The second statement says exactly the same thing.
15 Name-Surname: CLASSWORK 3 Find two integers p and q such that 23p + 33q = 1 Using Euclid s algorithm = = = = 0 Therefore gcd(33, 23) = 1 which means they are relatively prime. Reverse this process to obtain: 1 = = 10 3 ( ) = = ( ) = So p = 10 and q = 7.
16 Name-Surname: CLASSWORK 3 Find two integers p and q such that 42p + 51q = 3 Using Euclid s algorithm = = = = 0 Therefore gcd(51, 42) = 3. Reverse this process to obtain: 3 = = 9 1 (42 4 9) = = ( ) = So p = 6 and q = 5.
17 Name-Surname: CLASSWORK 4 Let S be the set of real numbers [ 1, 1]. Consider the relation R on S defined by: (x, y) R if x 2 + y 2 = 1 a) Is this relation Reflexive? b) Is this relation Symmetric? c) Is this relation Antisymmetric? d) Is this relation Transitive? Explain your answers. a) this relation is NOT Reflexive. b) If x 2 + y 2 = 1 then y 2 + x 2 = 1 this relation is Symmetric. c) (1, 0) R and (0, 1) R this relation is NOT Antisymmetric. d) (1, 0) R and (0, 1) R but (1, 1) / R this relation is NOT Transitive.
18 Name-Surname: CLASSWORK 4 Let S be the set of integers {2, 3, 4, 6, 8, 12, 16, 24, 48, 72, 96}. Consider the relation R on S defined by: (m, n) R if m n a) Is this relation Reflexive? b) Is this relation Symmetric? c) Is this relation Antisymmetric? d) Is this relation Transitive? Explain your answers. a) m m this relation is Reflexive. b) 2 4 but 4 2 this relation is NOT Symmetric. c) If m n and n m at the same time, then m = n this relation is Antisymmetric. d) If k m and m n then obviously k n this relation is Transitive.
19 Name-Surname: CLASSWORK 5 We choose n different 3-digit numbers randomly. We claim with certainty that there are at least two among them such that their difference is a 3 digit number with identical digits. (Such as 111,222, etc) What can you say about n? Consider all these n numbers modulo 111. Clearly, there are 111 categories: {0, 1, 2,..., 110}. Therefore if n 112 there are at least two numbers in the same category. These two numbers are different, so their difference cannot be 0. Therefore it must be a positive multiple of 111.
20 Name-Surname: CLASSWORK 5 We randomly place 13 squares of side length 1 inside a circle of radius 2. Show that at least two of the squares intersect. A circle of radius 2 has area 4π = < 13. These thirteen unit squares have a total area of 13. Therefore at least two squares must intersect.
21 Name-Surname: CLASSWORK 6 An online dating service will match the women A,B,C with the men U,V,W,X,Y,Z. Women s constraints are: A does not want X. B does not want Y. C does not want Z. Men have no constraints. How many matchings are possible? We will use inclusion-exclusion to count the distributions as follows: All matched randomly One woman is matched to someone she does not want, the others are matched randomly + Two women are matched to someone they do not want, the other is matched randomly Three women are matched to someone they do not want = 71
22 Name-Surname: CLASSWORK 6 An online dating service will match the women A,B,C with the men U,V,W,X,Y,Z. Women s constraints are: A does not want X. B does not want X and Y. C does not want X,Y and Z. Men have no constraints. How many matchings are possible? First Solution: : We will use inclusion-exclusion to count the distributions as follows: All matched randomly One woman is matched to someone she does not want, the others are matched randomly + Two women are matched to someone they do not want, the other is matched randomly Three women are matched to someone they do not want = 27 Second Solution: : A better idea is to eliminate X in the beginning: = 27 Third Solution: : An even better idea is this: First match C. She has 3 choices. (U,V,W) Then match B. She has 3 choices. (4-1) Then match A. She has 3 choices. (5-2) Therefore there are = 27 different matchings.
23 Name-Surname: CLASSWORK 7 How many integer solution are there for the equation x 1 + x 2 + x 3 + x 4 = 21 satisfying the following conditions? 0 x 1 3 x x x 4 The series product representing possible solutions is: (1 + x + x 2 + )(x 3 + x x 8 )(1 + x + x 2 + x 3 + x 4 )(x 7 + x 8 + ) = 1 1 x x 3 (1 x 6 ) 1 x (1 x 5 ) 1 x x 7 1 x = x10 (1 x 5 x 6 + x 11 ) (1 x) 4 ) ( ) n + 3 = (x 10 x 15 x 16 + x 21 x n n n=0 Coefficient of the term x 21 in this series expansion is: ( ) ( ) 9 6 ( ) ( ) 3 = 225 0
24 Name-Surname: CLASSWORK 7 How many integer solution are there for the equation x 1 + x 2 + x 3 + x 4 = 19 satisfying the following conditions? 0 x 1 2 x x x 4 The series product representing possible solutions is: (1 + x + x 2 + )(x 2 + x x 9 )(x + x x 6 )(x 3 + x 4 + ) = 1 1 x x 2 (1 x 8 ) 1 x x(1 x 6 ) 1 x x 3 1 x = x6 (1 x 6 x 8 + x 14 ) (1 x) 4 = ) ( ) n + 3 (x 6 x 12 x 14 + x 20 x n n n=0 Coefficient of the term x 19 in this series expansion is: ( ) ( ) 10 7 ( ) 8 = 384 5
25 Name-Surname: CLASSWORK 8 We will form 16 letter sequences using the letters {x, y, z} with the following conditions: There will be at least 4 x s, Number of y s will be even. How many sequences are possible? We have to use exponential series to represent possible solutions, because order is important: ( ) ) ) x 4 (1 4! + x5 5! + + (1 x2 2! + x4 4! + + x + x2 2! + x3 3! + = [ e x (1 + x + x2 2! + x3 3! )] ( e x + e x 2 ) e x ) ( = (1 e3x 2 + ex 2 + x + x2 2! + x3 e 2x 3! ) 2 Coefficient of the term x16 16! in the series expansion is: ( ) = ! 3!
26 Name-Surname: CLASSWORK 8 We will form 16 letter sequences using the letters {x, y, z} with the following conditions: There will be at least 2 x s, Number of y s will be odd. How many sequences are possible? We have to use exponential series to represent possible solutions, because order is important: ( ) ) ) x 2 (x 2! + x3 3! + + (1 x3 3! + x5 5! + + x + x2 2! + x3 3! + ( ) e = (e x x e x 1 x) e x 2 = e3x 2 ex x ( e 2x 1 ) 2 Coefficient of the term x16 16! in the series expansion is: 1 ( ) =
27 Name-Surname: CLASSWORK 9 A very large number of students take an examination. Their grades are integers in the range [100, 700]. We randomly select 2048 groups of students. Each group consists of 3 students. Show that we can always find 2 groups with exactly the same average grade. The possible values for group sum are: {300, 301, 302,..., 2100} There are 1801 possible values for group averages. This makes 1801 holes and 2048 pigeons. Therefore there are 2048 = 1.14 = groups with the same average by pigeonhole principle.
28 Name-Surname: CLASSWORK 9 A very large number of students take an examination. Their grades are integers in the range [250, 750]. We randomly select 1999 groups of students. Each group consists of 3 students. Show that we can always find 2 groups with exactly the same average grade. The possible values for group sum are: {750, 751, 752,..., 2250} There are 1501 possible values for group averages. This makes 1501 holes and 1999 pigeons. Therefore there are 1999 = 1.33 = groups with the same average by pigeonhole principle. Author: Dr. Emre Sermutlu June 23, 2016
First Midterm Examination
2015-2016 Spring Semester First Midterm Examination 1) How many numbers in the set {1000, 1001, 1002,..., 9999} have sum of digits equal to 17? 2) Let n Z +. Find the negation, converse and contrapositive
More informationFirst Midterm Examination
2012-2013 Fall Semester First Midterm Examination 1) You can buy a pizza with 5 toppings. There are 8 possibilities for toppings: Pepperoni, ham, chicken, tuna, mushroom, shrimp, onion, olives. a) How
More informationNotes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Combinatorics Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 4.1-4.6 & 6.5-6.6 of Rosen cse235@cse.unl.edu
More informationIntroduction to Decision Sciences Lecture 10
Introduction to Decision Sciences Lecture 10 Andrew Nobel October 17, 2017 Mathematical Induction Given: Propositional function P (n) with domain N + Basis step: Show that P (1) is true Inductive step:
More informationDiscrete Mathematics and Probability Theory Summer 2015 Chung-Wei Lin Midterm 1
CS 70 Discrete Mathematics and Probability Theory Summer 2015 Chung-Wei Lin Midterm 1 PRINT Your Name:, last) first) SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: 2050 VLSB 10 EVANS OTHER
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More 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 information1 The Basic Counting Principles
1 The Basic Counting Principles The Multiplication Rule If an operation consists of k steps and the first step can be performed in n 1 ways, the second step can be performed in n ways [regardless of how
More informationProb. 1 Prob. 2 Prob. 3 Total
EECS 70 Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai MT 1 Solution PRINT your student ID: PRINT AND SIGN your name:, (last) (first) (signature) PRINT your Unix account login: cs70-
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More informationMCS Introduction to Probability and Statistics FIRST MIDTERM
Department of Mathematics and Computer Sciences 1-11 Spring Semester MCS 4 - Introduction to Probability and Statistics FIRST MIDTERM 1 The following data represents the grades of a group of students:
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 informationMATH 3012 N Homework Chapter 9
MATH 01 N Homework Chapter 9 February, 017 The recurrence r n+ = r n+1 + r n can be expressed with advancement operators as A A )r n = 0 The quadratic can then be factored using the quadratic formula,
More informationDiscrete Mathematics and Probability Theory Fall 2014 Anant Sahai Midterm 1
EECS 70 Discrete Mathematics and Probability Theory Fall 2014 Anant Sahai Midterm 1 Exam location: 10 Evans, Last name starting with A-B or R-T PRINT your student ID: PRINT AND SIGN your name:, (last)
More informationCS 210 Foundations of Computer Science
IIT Madras Dept. of Computer Science & Engineering CS 210 Foundations of Computer Science Debdeep Mukhopadhyay Counting-II Pigeonhole Principle If n+1 or more objects (pigeons) are placed into n boxes,
More informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
More informationIntermediate Math Circles February 14, 2018 Contest Prep: Number Theory
Intermediate Math Circles February 14, 2018 Contest Prep: Number Theory Part 1: Prime Factorization A prime number is an integer greater than 1 whose only positive divisors are 1 and itself. An integer
More informationCDM Combinatorial Principles
CDM Combinatorial Principles 1 Counting Klaus Sutner Carnegie Mellon University Pigeon Hole 22-in-exclusion 2017/12/15 23:16 Inclusion/Exclusion Counting 3 Aside: Ranking and Unranking 4 Counting is arguably
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 informationCSCI 150 Discrete Mathematics Homework 5 Solution
CSCI 150 Discrete Mathematics Homework 5 Solution Saad Mneimneh Computer Science Hunter College of CUNY Problem 1: Happy Birthday (if it applies to you)! Based on the size of the class, there is approximately
More informationChapter 2: The Logic of Quantified Statements. January 22, 2010
Chapter 2: The Logic of Quantified Statements January 22, 2010 Outline 1 2.1- Introduction to Predicates and Quantified Statements I 2 2.2 - Introduction to Predicates and Quantified Statements II 3 2.3
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 Thursday July 17, 2014, 12:40pm-2:00pm. Instructions: Do not turn over this page until the proctor tells you to. Don t
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationCS Foundations of Computing
IIT KGP Dept. of Computer Science & Engineering CS 30053 Foundations of Computing Debdeep Mukhopadhyay Pigeon Hole Principle 1 Pigeonhole Principle If n+1 or more objects (pigeons) are placed into n boxes,
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 (Version B)
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 (Version B) Instructions: Do not turn over this page until the proctor tells you to. Don t write any answers on the backs
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 informationCSC 125 :: Final Exam December 14, 2011
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 14, 2011 p q p q p q p q p q p q T T F F T F T F (6 9) Let p be: Log rolling is fun. q be: The sawmill is closed. Express these as English
More informationMATH 3012 N Solutions to Review for Midterm 2
MATH 301 N Solutions to Review for Midterm March 7, 017 1. In how many ways can a n rectangular checkerboard be tiled using 1 and pieces? Find a closed formula. If t n is the number of ways to tile the
More informationRecitation 4: Quantifiers and basic proofs
Math 299 Recitation 4: Quantifiers and basic proofs 1. Quantifiers in sentences are one of the linguistic constructs that are hard for computers to handle in general. Here is a nice pair of example dialogues:
More informationFoundations of Computer Science Lecture 14 Advanced Counting
Foundations of Computer Science Lecture 14 Advanced Counting Sequences with Repetition Union of Overlapping Sets: Inclusion-Exclusion Pigeonhole Principle Last Time To count complex objects, construct
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 8 Solutions
Basic Combinatorics Math 4010, Section 01 Fall 01 Homework 8 Solutions 1.8.1 1: K n has ( n edges, each one of which can be given one of two colors; so Kn has (n -edge-colorings. 1.8.1 3: Let χ : E(K k
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationLecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya Resources: Kenneth
More informationMidterm 1. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:
CS70 Discrete Mathematics and Probability Theory, Fall 2018 Midterm 1 8:00-10:00pm, 24 September Your First Name: SIGN Your Name: Your Last Name: Your Exam Room: Name of Person Sitting on Your Left: Name
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationAt least one of us is a knave. What are A and B?
1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either
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 378 Spring 2011 Assignment 4 Solutions
Math 3 Spring 2011 Assignment 4 Solutions Brualdi 6.2. The properties are P 1 : is divisible by 4. P 2 : is divisible by 6. P 3 : is divisible by. P 4 : is divisible by 10. Preparing to use inclusion-exclusion,
More informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationCalculator Exam 2009 University of Houston Math Contest. Name: School: There is no penalty for guessing.
Calculator Exam 2009 University of Houston Math Contest Name: School: Please read the questions carefully. Unless otherwise requested, round your answers to 8 decimal places. There is no penalty for guessing.
More informationAn Introduction to Combinatorics
Chapter 1 An Introduction to Combinatorics What Is Combinatorics? Combinatorics is the study of how to count things Have you ever counted the number of games teams would play if each team played every
More informationMath Fall 2010 Some Old Math 302 Exams There is always a danger when distributing old exams for a class that students will rely on them
Math 302.102 Fall 2010 Some Old Math 302 Exams There is always a danger when distributing old exams for a class that students will rely on them solely for their final exam preparations. The final exam
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More informationAB ExamSolutions Texas A&M High School Math Contest November 8, 2014
AB ExamSolutions Texas A&M High School Math Contest November 8, 2014 1. What is the largest power of 2 that divides 2 2013 + 10 2013? ANSWER: 2 2014 Solution: 2 2013 + 10 2013 = 2 2013 (1 + 5 2013 ). Since
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationChapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers
Fry Texas A&M University! Fall 2016! Math 150 Notes! Section 1A! Page 1 Chapter 1A -- Real Numbers Math Symbols: iff or Example: Let A = {2, 4, 6, 8, 10, 12, 14, 16,...} and let B = {3, 6, 9, 12, 15, 18,
More informationLecture 3: Miscellaneous Techniques
Lecture 3: Miscellaneous Techniques Rajat Mittal IIT Kanpur In this document, we will take a look at few diverse techniques used in combinatorics, exemplifying the fact that combinatorics is a collection
More informationChapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula
Chapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula Prof. Tesler Math 184A Fall 2019 Prof. Tesler Ch. 7. Inclusion-Exclusion Math 184A / Fall 2019 1 / 25 Venn diagram and set sizes A = {1, 2, 3, 4,
More informationUnit Combinatorics State pigeonhole principle. If k pigeons are assigned to n pigeonholes and n < k then there is at least one pigeonhole containing more than one pigeons. Find the recurrence relation
More informationIndistinguishable objects in indistinguishable boxes
Counting integer partitions 2.4 61 Indistinguishable objects in indistinguishable boxes When placing k indistinguishable objects into n indistinguishable boxes, what matters? We are partitioning the integer
More informationExam 2 Review Chapters 4-5
Math 365 Lecture Notes S. Nite 8/18/2012 Page 1 of 9 Integers and Number Theory Exam 2 Review Chapters 4-5 Divisibility Theorem 4-1 If d a, n I, then d (a n) Theorem 4-2 If d a, and d b, then d (a+b).
More informationRecursive Definitions
Recursive Definitions Example: Give a recursive definition of a n. a R and n N. Basis: n = 0, a 0 = 1. Recursion: a n+1 = a a n. Example: Give a recursive definition of n i=0 a i. Let S n = n i=0 a i,
More informationand problem sheet 1
21-128 and 15-151 problem sheet 1 Solutions to the following seven exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Wednesday 5th September 2018. Problem 1 Suppose
More informationChapter 1 Math Set: a collection of objects. For example, the set of whole numbers is W = {0, 1, 2, 3, }
Chapter 1 Math 3201 1 Chapter 1: Set Theory: Organizing information into sets and subsets Graphically illustrating the relationships between sets and subsets using Venn diagrams Solving problems by using
More informationDiscrete Mathematics, Spring 2004 Homework 4 Sample Solutions
Discrete Mathematics, Spring 2004 Homework 4 Sample Solutions 4.2 #77. Let s n,k denote the number of ways to seat n persons at k round tables, with at least one person at each table. (The numbers s n,k
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationGRE Workshop Quantitative Reasoning. February 13 and 20, 2018
GRE Workshop Quantitative Reasoning February 13 and 20, 2018 Overview Welcome and introduction Tonight: arithmetic and algebra 6-7:15 arithmetic 7:15 break 7:30-8:45 algebra Time permitting, we ll start
More informationCS1800 Discrete Structures Spring 2018 February CS1800 Discrete Structures Midterm Version A
CS1800 Discrete Structures Spring 2018 February 2018 CS1800 Discrete Structures Midterm Version A Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationVALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SUBJECT QUESTION BANK : MA6566 \ DISCRETE MATHEMATICS SEM / YEAR: V / III year CSE. UNIT I -
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and
More informationChapter 1: Inductive and Deductive Reasoning
Chapter 1: Inductive and Deductive Reasoning Section 1.1 Chapter 1: Inductive and Deductive Reasoning Section 1.1: Making Conjectures: Inductive Reasoning Terminology: Conjecture: A testable expression
More informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 57
More informationAMC Preparation Berkeley Math Circle January 31, 2012
AMC Preparation Berkeley Math Circle January 31, 2012 This handout serves as a preparation for the AMC12. The best way to prepare is to practice, practice, practice, and hence this handout contains many
More informationCh 3.2: Direct proofs
Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations
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 informationIntroduction to Decision Sciences Lecture 11
Introduction to Decision Sciences Lecture 11 Andrew Nobel October 24, 2017 Basics of Counting Product Rule Product Rule: Suppose that the elements of a collection S can be specified by a sequence of k
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : April-May 2018 BOOK FOR REFERENCE To buy the book visit : Sri Hariganesh
More informationCounting. Math 301. November 24, Dr. Nahid Sultana
Basic Principles Dr. Nahid Sultana November 24, 2012 Basic Principles Basic Principles The Sum Rule The Product Rule Distinguishable Pascal s Triangle Binomial Theorem Basic Principles Combinatorics: The
More informationProblem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets
More information324 Stat Lecture Notes (1) Probability
324 Stat Lecture Notes 1 robability Chapter 2 of the book pg 35-71 1 Definitions: Sample Space: Is the set of all possible outcomes of a statistical experiment, which is denoted by the symbol S Notes:
More informationAdvanced Counting Techniques. Chapter 8
Advanced Counting Techniques Chapter 8 Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence Relations Nonhomogeneous Recurrence Relations Divide-and-Conquer
More information3. Applying the definition, we have 2#0 = = 5 and 1#4 = = 0. Thus, (2#0)#(1#4) = 5#0 = ( 5) 0 ( 5) 3 = 2.
JHMMC 01 Grade 7 Solutions October 1, 01 1. There are 16 words in the sentence, and exactly 5 of them have four letters, as shown: What is the probability that a randomly chosen word of this sentence has
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationSection 1.3. Let I be a set. When I is used in the following context,
Section 1.3. Let I be a set. When I is used in the following context, {B i } i I, we call I the index set. The set {B i } i I is the family of sets of the form B i where i I. One could also use set builder
More informationPUTNAM TRAINING PROBLEMS
PUTNAM TRAINING PROBLEMS (Last updated: December 3, 2003) Remark This is a list of Math problems for the NU Putnam team to be discussed during the training sessions Miguel A Lerma 1 Bag of candies In a
More informationB B3B037 Total Pages:3
B B3B037 Total Pages:3 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JANUARY 2017 Course Code: CS 201 Course Name: DISCRETE COMPUTATIONAL STRUCTURES
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationMidterm 1. Name: TA: U.C. Berkeley CS70 : Algorithms Midterm 1 Lecturers: Anant Sahai & Christos Papadimitriou October 15, 2008
U.C. Berkeley CS70 : Algorithms Midterm 1 Lecturers: Anant Sahai & Christos Papadimitriou October 15, 2008 Name: Midterm 1 TA: Answer all questions. Read them carefully first. Be precise and concise. The
More informationCSC 125 :: Final Exam December 15, 2010
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 15, 2010 p q p q p q p q p q p q T T F F T F T F 6-13. Fill in the missing portion of each of the rules of inference named below: 6.
More information2009 Sample Math Proficiency Exam Worked Out Problems
Page 1 of 18 2009 Sample Math Proficiency Exam Worked Out Problems The following solutions to the practice exam provide the methods that I would use to get a solution. These are not the only ways to get
More information6.8 The Pigeonhole Principle
6.8 The Pigeonhole Principle Getting Started Are there two leaf-bearing trees on Earth with the same number of leaves if we only consider the number of leaves on a tree at full bloom? Getting Started Are
More informationGRE. Advanced GRE Math Questions
Advanced GRE Math Questions Quantitative Arithmetic 1. What is the sum of all integers x, such that 7 < x 5? 7 7 6 6 7 1. C Quantitative Fractions and Ratios 1. The current ratio of boys to girls at a
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More information2030 LECTURES. R. Craigen. Inclusion/Exclusion and Relations
2030 LECTURES R. Craigen Inclusion/Exclusion and Relations The Principle of Inclusion-Exclusion 7 ROS enumerates the union of disjoint sets. What if sets overlap? Some 17 out of 30 students in a class
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationMATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics
MATH 341, Section 001 FALL 2014 Introduction to the Language and Practice of Mathematics Class Meetings: MW 9:30-10:45 am in EMS E424A, September 3 to December 10 [Thanksgiving break November 26 30; final
More informationMATH 1710 College Algebra Final Exam Review
MATH 1710 College Algebra Final Exam Review MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the problem. 1) There were 480 people at a play.
More informationThank you for your participation Good Luck!
Friday, September 11, 2009 Choose 10 different numbers from {0, 1, 2,, 14} and put them into the following circles. If there is an edge between two circles, then take the absolute value of their difference.
More information7.2 Applications of Euler s and Fermat s Theorem.
7.2 Applications of Euler s and Fermat s Theorem. i) Finding and using inverses. From Fermat s Little Theorem we see that if p is prime and p a then a p 1 1 mod p, or equivalently a p 2 a 1 mod p. This
More informationChapter 1. Pigeonhole Principle
Chapter 1. Pigeonhole Principle Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 1. Pigeonhole Principle Math 184A / Fall 2017 1 / 16 Pigeonhole principle https://commons.wikimedia.org/wiki/file:toomanypigeons.jpg
More informationMath Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions
Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number
More informationThe PRIMES 2014 problem set
Dear PRIMES applicant! The PRIMES 24 problem set This is the PRIMES 24 problem set. Please send us your solutions as part of your PRIMES application by December, 24. For complete rules, see http://web.mit.edu/primes/apply.shtml
More informationDiscrete Mathematics and Probability Theory Fall 2017 Ramchandran and Rao Midterm 2 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2017 Ramchandran and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel
More informationSolutions Math is Cool HS Championships Mental Math
Mental Math 9/11 Answer Solution 1 30 There are 5 such even numbers and the formula is n(n+1)=5(6)=30. 2 3 [ways] HHT, HTH, THH. 3 6 1x60, 2x30, 3x20, 4x15, 5x12, 6x10. 4 9 37 = 3x + 10, 27 = 3x, x = 9.
More informationCSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Review for the Final! Hyunyoung Lee! 1 Final Exam Section 501 (regular class time 8:00am) Friday, May 8, starting at 1:00pm in our classroom!! Section 502 (regular
More informationBRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2017 Junior Preliminary Problems & Solutions
BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 017 Junior Preliminary Problems & s 1. If x is a number larger than, which of the following expressions is the smallest? (A) /(x 1) (B) /x (C) /(x
More informationInteractive Study Guide Solving Two-Step Equations
11-1 To solve equations with more than one operation, or a two-step equation, follow the order of operations in reverse. First add or subtract then, multiply or divide. Solving Two-Step Equations Using
More information