Discrete Mathematics Exam File Fall Exam #1

Size: px
Start display at page:

Download "Discrete Mathematics Exam File Fall Exam #1"

Transcription

1 Discrete Mathematics Exam File Fall 2015 Exam #1 1.) Which of the following quantified predicate statements are true? Justify your answers. a.) n Z, k Z, n + k = 0 b.) n Z, k Z, n + k = 0 2.) Prove that the difference of two even numbers is even. 3.) Construct a truth table for: (p q) q 4.) Consider the following statement: If it walks like a duck and it talks like a duck, then it is a duck. Let p: It walks like a duck. q: It talks like a duck. r: It is a duck. Write the statement symbolically. 5.) Evaluate each of the following. a.) b.) 17 mod 6 c.) -15 mod 8 d.) 5 (n 2 + 3) n=1 49 n=1 e.) n 6.) Construct a truth table to verify that (p q) ( p q). 7.) Find a general form for the sequence whose first five terms are: 4, 9, 16, 25, 36 8.) Prove that the square of an odd number is odd. Exam #2 1.) Use induction to prove the following. n i 2 = i=1 n (n + 1)(2 n + 1) 6 2.) Suppose our universe set is U = {a, b, c, d, e, f, g, h}, A = {a, c, e, g, h} and B = {a, d, f, h}. Find the following. a.) A B b.) A B' c.) A - B d.) A B e.) (A B)' 3.) Use Venn Diagrams to demonstrate that (A B)' = A' B'. 4.) Prove that (A B)' = A' B'. Do not use a Venn Diagram. 5.) Each number in the following Venn Diagram demonstrates how many elements of the universe set fall into the particular region shown. Using these numbers, verify that the inclusion-exclusion principle holds for A B C.

2 6.) You have a basket with apples in it. There are 23 green apples, 14 red apples and 8 plaid apples. You are going to take some apples out of the basket. a.) How many apples must you take out of the basket to be absolutely certain you have removed a matching pair of apples? b.) How many apples must you take out of the basket to be absolutely certain you have removed a matching pair of plaid apples? c.) How many apples must you take out of the basket to be absolutely certain you have removed four apples of the same color? 7.) Prove the following: If A B, then B' A'. Do not use a Venn Diagram. 8.) Use the pigeonhole principle to show that given any five positive integers, there must there be two whose difference is divisible by 4. 9.) Prove that for all integers a, b and c, if a divides b and b divides c, then a divides c. 10.) Use a proof by contradiction or contrapositive to show the following: Suppose n is a positive integer. If n 2 is even then n is even. Exam #2 1.) Use induction to prove the following. n i 3 i=1 = n2 (n + 1) ) Suppose our universe set is U = {a, b, c, d, e, f, g, h}, A = {a, c, g, h}, B = {d, f} and C = {b, e, f}. Find the following. a.) Do A, B and C form a partition of U? Explain your answer. b.) A B c.) C - B d.) A B' e.) (A C)'

3 3.) Use Venn Diagrams to prove or disprove that (A B)' = A' B'. Be sure to clearly state your conclusion. 4.) Prove that (A B)' = A' B'. Do not use a Venn Diagram. 5.) Suppose A B = 12, A B = 4, and A = 10. How many elements are in B? SHOW YOUR WORK!! 6.) You have a basket with apples in it. There are 12 green apples, six red apples and 11 plaid apples. You are going to take some apples out of the basket. a.) How many apples must you take out of the basket to be absolutely certain you have removed a matching pair of apples? b.) How many apples must you take out of the basket to be absolutely certain c.) you have removed a pair of plaid apples? How many apples must you take out of the basket to be absolutely certain you have removed seven apples of the same color? 7.) Prove the following: A (A B). Do not use a Venn Diagram. 8.) Use the pigeonhole principle to show that given any seven positive integers, there must there be three whose sum is divisible by 3. 9.) Prove that for all integers a, b and c, if a divides b and a divides c, then a divides b+c. 10.) Use a proof by contradiction or contrapositive to show the following: Suppose n is a positive integer. If n 2 is odd then n is odd. Exam #3 1.) Consider the following functions. f(x) = 3x - 4 g(x) = x 2 4 Do the following. a.) Find (f + g)(3). b.) Find the domain of g. c.) Determine whether or not f is 1-1. d.) If f is 1-1, find f -1. If not, write "Ha-Ha, I don't have to do this." e.) Find f f (5). f.) x 2 If the codomain for f is R, determine (with explanation) whether it is onto. If it is not, find the range. g.) Find f(x 2 + 1). h.) Find g(bob). i.) Determine whether or not g is ) Let A = R. Define the relation, R, on A by (a, b) R if and only if a * b > 0. a.) Is R reflexive? Explain. b.) Is R symmetric? Explain. c.) d.) e.) Is R transitive? Explain. Is R an equivalence relation? Explain your response. If R is an equivalence relation, list the equivalence classes. If it is not, write "Ha-Ha, I don't have to do this." 3.) Let A =Z. Define the relation, R, on A by (a, b) R if and only if a * b is even. a.) Is R reflexive? Explain. b.) Is R symmetric? Explain.

4 c.) d.) e.) Is R transitive? Explain. Is R an equivalence relation? Explain your response. If R is an equivalence relation, list the equivalence classes. If it is not, write "Ha-Ha, I don't have to do this." 4.) How many positive integers less than 1000 are multiples of 2, 3, or 5? 5.) What is the largest power of 5 that divides 1002!? 6.) The members of the Clark County Underwater Basket Weaving Club are as follows.8 Mr. & Mrs. Thomrangwithawatpong Mr. & Mrs. Ng Mr. & Mrs. Saltalamacchia Mr. & Mrs. Humperdink Mr. & Mrs. Holmes Mr. Watson All eleven members are present at the November meeting. a.) The members get in line for the lunch buffet. How many different lines are possible? b.) How many different lines are possible if each couple stands in line together? c.) How many different lines are possible if each couple stands in line together and Mr. Watson stands with Mr. & Mrs. Holmes (but not between them)? d.) For lunch they sit at a round table. In how many orders can they sit? e.) At the round table, in how many orders can they sit if couples must sit together? f.) During the meeting they put together a committee for the planning of their Lake Degray underwater basket weaving excursion. How many five person committees can be chosen? g.) How many five person committees can be chosen if there is a president, vice-president, secretary, treasurer and sergeant-at-arms? h.) How many five person committees can be chosen if at least three members must be female? i.) How many five person committees can be chosen if at least three members must be female and if there is a president, vice-president, secretary, treasurer and sergeant-at-arms? 7.) a.) How many different ways can three non-negative integers, x, y and z, add b.) up to 28? How many different ways can three positive integers, x, y and z, add up to 28? c.) How many different ways can three integers, x, y and z, add up to 28 if x > 0, y > 0 and z > 2? 8.) Use the binomial theorem to expand (2x - 3y) 5. Show all your work. 9.) Consider (x + 2y 2 ) 8. a.) Find the coefficient of the x 4 y 4 term. b.) Find the term (not just the coefficient) of the term with y 6 in it. 10.) Find the largest power of 12 that divides 1002!. 11.) In how many ways can you break 16 different people into four groups of 4 people, assuming the groups are distinct? 12.) Thirty runners run in a race. Trophies will be given to the top 8 runners (the trophies are distinct: first place, second place, etc.). How many ways can this be done?

5 13.) Consider the set S = {a, b, c, d, e, f, g}. a.) How many "words" of no more than five letters can be obtained from the letters in S? b.) How many five letter "words" can be obtained from S if no letter may be repeated? c.) How many five letter "words" can be obtained from S if at most one letter can appear twice? 14.) How many distinguishable lines can be obtained by arranging five identical red marbles, four identical green marbles and six identical plaid marbles in a line? Exam #4 1.) How many bags of 20 pieces of candy can one buy from a store that sells four types of candy? 2.) How many distinguishable arrangements of the letters in the word MISSISSIPPI are there? 3.) How many distinguishable four letter words can be made from the letters in the word PEOPLE? 4.) Show a solution to the following Tower of Hanoi puzzle. 5.) You flip a coin 14 times. What is the probability that you get heads exactly nine times? Show all necessary work and leave your answer as a decimal. 6.) Team A has a probability of 3/5 of winning any given game against Team B. Suppose the teams are playing a best of five tournament. a.) What is the probability Team A wins in three games? b.) What is the probability Team A wins in four games? c.) What is the probability Team A wins in five games? d.) What is the probability Team B wins the tournament? 7.) You roll a fair six-sided die four times. E1 is the event that the first two rolls sum to 7. E2 is the event that the last two rolls sum to 10. What is the probability of E1 or E2 happening? 8.) A game is played by pulling one of the following pieces of paper from a hat. The player wins the amount on the piece of paper. What is the expected value of the player's win? Show your work. $1 $1 $3 $3 $4 $4 $4 $5 $5 $6 $8 $10 9.) For each degree sequence below, in row A, draw a tree with that degree sequence and leave rows B and C blank. If no such tree exists, tell why no such tree exists.

6 A B C A B C If no such tree exists, in row B draw a simple graph with that degree sequence and leave row C blank. If no such simple graph exists, tell why no such simple graph exists. If no such simple graph exists, in row C draw a graph with that degree sequence. If no such graph exists, tell why no such graph exists. You should have no more than one graph for each degree sequence 1, 1, 1, 1, 2, 2, 3, 3 4, 4, 4, 4, 4 0, 0, 0, 1, 2, 3, 4, 5, 6, 7 0, 0, 1, 2, 3 Final Exam 1. Consider a group of 9 men and 13 women. a. How many five person committees can be chosen? b. How many five person committees can be chosen if the committee is to have at least four women? c. How many five person committees can be chosen if the committee has a president, vice-president, secretary and treasurer? 2. Consider the letters in the word MISSISSIPPI. a. How many distinguishable arrangements of the letters are there (using ALL the letters)? b. How many distinguishable arrangements are there if all letters are used and the Ps end up adjacent to each other? 3. In how many ways can four non-negative integers add up to 22? 4. In how many ways can 27 pennies be distributed among 5 children so that each child gets at least two pennies? 5. Construct a truth table for the following. ( p) (p q) 6. Use a Venn diagram to represent the set A B C. 7. Find a counterexample to show that the following statement is false. Clearly illustrate that it is a counter example. A ( B C) ( A B) C 8. Using an element-wise proof, prove either direction of the proof that (A B) C = (A C) (B C). You must use an element-wise proof for credit. 9. Prove 2 is irrational. 10. Complete exactly two of the following proofs. If you do more than two proofs, only the first two will be graded. a. If n is odd, then n 3 n is divisible by 4. b. If 3n is odd, then n is odd.

7 c. If n 2 is odd, then n is odd. 11. Prove the following statement is true for all integers n 1, using mathematical induction n 2 = n (n + 1)(2n + 1) Let R be a relation on R (the set of real numbers) given by the rule (x, y) R iff x - y is divisible by 3. Prove that R is an equivalence relation by proving it is reflexive, symmetric and transitive. 13. Use the Binomial Theorem for each of the following. a. Expand (x - 2y) 4. b. Determine the coefficient of x 4 y 7 in the expansion of (2x y) In how many ways can eight people be seated around a circular table? 15. Let our "universe" be U={a, b, c, d, e, f, g, h, i, j, k}. Let A={a, b, c, d}, B={a, e, i}, and C={a, b, e, i}. Evaluate each of the following. a. Evaluate (A C) B. b. Evaluate A B C. c. Evaluate (B C) - A. 16. Suppose you have a class of 23 students. a. Explain why it must be true that at least two students must share the same birth month. b. How many more students must be present to be guaranteed that three share the same birth month? c. How many more students must be present to be guaranteed that seven share the same birth month? 17. Consider the sequences that follow. For each, if it is possible, draw a tree with that degree sequence. If that is not possible, tell why and draw a simple graph with that degree sequence. If that is not possible, tell why and draw a graph with that degree sequence. If that is not possible, tell why. a. 1, 1, 1, 2, 3 b. 3, 4, 4, 4, 4, 5 c. 1, 2, 2, 3, 4, 4, 5

Discrete Structures. Fall Homework3

Discrete Structures. Fall Homework3 Discrete Structures Fall 2015 Homework3 Chapter 5 1. Section 5.1 page 329 Problems: 3,5,7,9,11,15 3. Let P(n) be the statement that 1 2 + 2 2 + +n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. a)

More information

2.) From the set {A, B, C, D, E, F, G, H}, produce all of the four character combinations. Be sure that they are in lexicographic order.

2.) From the set {A, B, C, D, E, F, G, H}, produce all of the four character combinations. Be sure that they are in lexicographic order. Discrete Mathematics 2 - Test File - Spring 2013 Exam #1 1.) RSA - Suppose we choose p = 5 and q = 11. You're going to be sending the coded message M = 23. a.) Choose a value for e, satisfying the requirements

More information

Math 187 Sample Test II Questions

Math 187 Sample Test II Questions Math 187 Sample Test II Questions Dr. Holmes October 2, 2008 These are sample questions of kinds which might appear on Test II. There is no guarantee that all questions on the test will look like these!

More information

Discrete Mathematics 2 Exam File Spring 2012

Discrete Mathematics 2 Exam File Spring 2012 Discrete Mathematics 2 Exam File Spring 2012 Exam #1 1.) Suppose f : X Y and A X. a.) Prove or disprove: f -1 (f(a)) A. Prove or disprove: A f -1 (f(a)). 2.) A die is rolled four times. What is the probability

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 PRINT Your Name:, (last) READ AND SIGN The Honor Code: As a member of the UC Berkeley community, I act with honesty,

More information

Solution : a) C(18, 1)C(325, 1) = 5850 b) C(18, 1) + C(325, 1) = 343

Solution : a) C(18, 1)C(325, 1) = 5850 b) C(18, 1) + C(325, 1) = 343 DISCRETE MATHEMATICS HOMEWORK 5 SOL Undergraduate Course College of Computer Science Zhejiang University Fall-Winter 2014 HOMEWORK 5 P344 1. There are 18 mathematics majors and 325 computer science majors

More information

Indicate the option which most accurately completes the sentence.

Indicate the option which most accurately completes the sentence. Discrete Structures, CSCI 246, Fall 2015 Final, Dec. 10 Indicate the option which most accurately completes the sentence. 1. Say that Discrete(x) means that x is a discrete structures exam and Well(x)

More information

MATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).

MATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ). MATH 139 W12 Review 1 Checklist 1 Exam Checklist 1. Introduction to Predicates and Quantified Statements (chapters 3.1-3.4). universal and existential statements truth set negations of universal and existential

More information

To illustrate what is intended the following are three write ups by students. Diagonalization

To illustrate what is intended the following are three write ups by students. Diagonalization General guidelines: You may work with other people, as long as you write up your solution in your own words and understand everything you turn in. Make sure to justify your answers they should be clear

More information

Combinatorics Problems

Combinatorics Problems Combinatorics Problems Math 380 - Problems from K. Bogart guided discovery approach adopted from Rosa Orellana 1 Basic Counting Principles 1. Five schools are going to send their baseball teams to a tournament,

More information

following determine whether it is an element, subset or neither of A and

following determine whether it is an element, subset or neither of A and 1. Let A, B, and C be subsets of the universal set U. Draw Venn diagrams illustrating the following: First, we have a square representing the universe U and three circles, one for each of A, B and C. Each

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam

More information

Discrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1

Discrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1 CS 70 Discrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 2050 VLSB A1 Hearst Annex 120 Latimer

More information

HMMT February 2018 February 10, 2018

HMMT February 2018 February 10, 2018 HMMT February 2018 February 10, 2018 Combinatorics 1. Consider a 2 3 grid where each entry is one of 0, 1, and 2. For how many such grids is the sum of the numbers in every row and in every column a multiple

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam

More information

Packet #6: Counting & Graph Theory. Applied Discrete Mathematics

Packet #6: Counting & Graph Theory. Applied Discrete Mathematics Packet #6: Counting & Graph Theory Applied Discrete Mathematics Table of Contents Counting Pages 1-8 Graph Theory Pages 9-16 Exam Study Sheet Page 17 Counting Information I. Product Rule: A B C = A * B

More information

Section Sets and Set Operations

Section Sets and Set Operations Section 6.1 - Sets and Set Operations Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase

More information

(l) Represent each of the sets A, B and C using bit strings. Then, use bit string representation and bitwise logical operations to find

(l) Represent each of the sets A, B and C using bit strings. Then, use bit string representation and bitwise logical operations to find Fall 2004 Ahmed Elgammal CS 205: Sample Final Exam December 6th, 2004 1. [10 points] Let A = {1, 3, 5, 7, 9}, B = {4, 5, 6, 7, 8}, C = {2, 4, 6, 8, 10}, D = {1, 2, 3} and let the universal set be U = {1,

More information

396 6 / Counting 6.1. Exercises

396 6 / Counting 6.1. Exercises 396 6 / Counting 6.1 Exercises 1. There are 18 mathematics majors and 325 computer science majors at a college. a) In how many ways can two representatives be picked so that one is a mathematics major

More information

THE UNIVERSITY OF MANITOBA

THE UNIVERSITY OF MANITOBA THE UNIVERSITY OF MANITOBA MATHEMATICS 3400 (Combinatorics I) March 4, 2011 MIDTERM EAM 2 hours (6-8 PM) EAMINER: R. Craigen Total Marks: 100 NAME: STUDENT NUMBER: INSTRUCTIONS Write your name and student

More information

STUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl

STUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl Page 1 of 13 NAME: STUDENT NUMBER: MATH 1281 - Final Exam Lakehead University April 13, 2011 Dr. Adam Van Tuyl Instructions: Answer all questions in the space provided. If you need more room, answer on

More information

Math 4410 Fall 2010 Exam 3. Show your work. A correct answer without any scratch work or justification may not receive much credit.

Math 4410 Fall 2010 Exam 3. Show your work. A correct answer without any scratch work or justification may not receive much credit. Math 4410 Fall 2010 Exam 3 Name: Directions: Complete all six questions. Show your work. A correct answer without any scratch work or justification may not receive much credit. You may not use any notes,

More information

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may

More information

r=1 The Binomial Theorem. 4 MA095/98G Revision

r=1 The Binomial Theorem. 4 MA095/98G Revision Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week Three Solutions Note: in these notes multiplication is assumed to take precedence over division, so 4!/2!2! = 4!/(2!*2!), and binomial coefficients are written horizontally: (4 2) denotes 4 choose

More information

Extra Practice Problems 2

Extra Practice Problems 2 CS103 Handout 31 Fall 2018 October 29, 2018 Extra Practice Problems 2 Here's a set of a bunch of practice problems you can work through to solidify your understanding of the topics from Problem Sets Three,

More information

MTH-129 Review for Test 4 Luczak

MTH-129 Review for Test 4 Luczak MTH-129 Review for Test 4 Luczak 1. On each of three consecutive days the National Weather Service announces that there is a 50-50 chance of rain. Assuming that they are correct, answer the following:

More information

CS228 - Basic Counting and the Pigeonhole Principle

CS228 - Basic Counting and the Pigeonhole Principle CS228 - Basic Counting and the Pigeonhole Principle Nathan Sprague February 19, 2014 Material in these slides is from Discrete Mathematics and Its Applications 7e, Kenneth Rosen, 2012. The Product Rule

More information

Exam 1 February 3, 2015

Exam 1 February 3, 2015 CSC 1300-003 Discrete Structures Exam 1 February 3, 2015 Name: KEY Question Value Score 1 20 2 20 3 20 4 20 5 20 OAL 100 Please answer questions in the spaces provided. If you make a mistake or for some

More information

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points

MC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you

More information

1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying.

1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying. May 9, 2003 Show all work Name There are 260 points available on this test 1 (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying where

More information

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final

CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may

More information

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers

Unit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers Contents STRAND B: Number Theory Unit 7 Number System and Bases Student Text Contents Section 7. Number System 7.2 Binary Numbers 7.3 Adding and Subtracting Binary Numbers 7.4 Multiplying Binary Numbers

More information

Discrete Structures Lecture The Basics of Counting

Discrete Structures Lecture The Basics of Counting Introduction Good morning. Combinatorics is the study of arrangements of objects. Perhaps, the first application of the study of combinatorics was in the study of gambling games. Understanding combinatorics

More information

MAA MD-DC-VA Section meeting, November Creative Approaches to Discrete Mathematics Brian Heinold Mount St. Mary s University

MAA MD-DC-VA Section meeting, November Creative Approaches to Discrete Mathematics Brian Heinold Mount St. Mary s University MAA MD-DC-VA Section meeting, November 2013 Creative Approaches to Discrete Mathematics Brian Heinold Mount St. Mary s University Reasoning question Consider the following statement: If G is Keplerian,

More information

Chapter 3. Set Theory. 3.1 What is a Set?

Chapter 3. Set Theory. 3.1 What is a Set? Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any

More information

Common Core State Standards Mathematics (Subset K-5 Counting and Cardinality, Operations and Algebraic Thinking, Number and Operations in Base 10)

Common Core State Standards Mathematics (Subset K-5 Counting and Cardinality, Operations and Algebraic Thinking, Number and Operations in Base 10) Kindergarten 1 Common Core State Standards Mathematics (Subset K-5 Counting and Cardinality,, Number and Operations in Base 10) Kindergarten Counting and Cardinality Know number names and the count sequence.

More information

2009 Fall Startup Event Thursday, September 24th, 2009

2009 Fall Startup Event Thursday, September 24th, 2009 009 Fall Startup Event This test consists of 00 problems to be solved in 0 minutes. All answers must be exact, complete, and in simplest form. To ensure consistent grading, if you get a decimal, mixed

More information

Standards for Mathematics: Grade 1

Standards for Mathematics: Grade 1 Standards for Mathematics: Grade 1 In Grade 1, instructional time should focus on four critical areas: 1. developing understanding of addition, subtraction, and strategies for addition and subtraction

More information

Practice Final. Read all the problems first before start working on any of them, so you can manage your time wisely

Practice Final. Read all the problems first before start working on any of them, so you can manage your time wisely PRINT your name here: Practice Final Print your name immediately on the cover page, as well as each page of the exam, in the space provided. Each time you are caught working on a page without your name

More information

CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM

CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM Name: Student ID: Signature: Section (circle one): George Steve Your signature acknowledges your understanding of and agreement

More information

BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI Department of Science and Humanities CS6702-GRAPH THEORY AND APPLICATION

BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI Department of Science and Humanities CS6702-GRAPH THEORY AND APPLICATION BHARATHIDASAN ENGINEERING COLLEGE NATTARAMPALLI 635 854 Department of Science and Humanities DEGREE/BRANCH : B.E. CSE YEAR/ SEMESTER : IV/VII. CS6702-GRAPH THEORY AND APPLICATION 1. Define graph. UNIT-I

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set

More information

correlated to the Michigan High School Mathematics Content Expectations

correlated to the Michigan High School Mathematics Content Expectations correlated to the Michigan High School Mathematics Content Expectations McDougal Littell Algebra 1 Geometry Algebra 2 2007 correlated to the STRAND 1: QUANTITATIVE LITERACY AND LOGIC (L) STANDARD L1: REASONING

More information

Lecture 3: Recursion; Structural Induction

Lecture 3: Recursion; Structural Induction 15-150 Lecture 3: Recursion; Structural Induction Lecture by Dan Licata January 24, 2012 Today, we are going to talk about one of the most important ideas in functional programming, structural recursion

More information

CS1800 Discrete Structures Final Version A

CS1800 Discrete Structures Final Version A CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use

More information

Final Exam May 6, 2015

Final Exam May 6, 2015 CSC 1300 - Discrete Structures Final Exam May 6, 2015 Name: Question Value Score 1 15 2 25 3 20 4 15 5 20 6 20 7 10 8 10 9 10 10 20 11 15 12 20 TOTAL 200 No calculators or any reference except your one

More information

Number Theory Open, Round 1 Test #101

Number Theory Open, Round 1 Test #101 Number Theory Open, Round 1 Test #101 1. Write your 6-digit ID# in the I.D. NUMBER grid, left-justified, and bubble. Check that each column has only one number darkened. 2. In the EXAM NO. grid, write

More information

Math 55 - Spring Lecture notes # 14 - March 9 (Tuesday)

Math 55 - Spring Lecture notes # 14 - March 9 (Tuesday) Math 55 - Spring 2004 - Lecture notes # 14 - March 9 (Tuesday) Read Chapter 4 Goals for Today: Continue counting principles Tree diagrams Pigeonhole principle Permutations Combinations Homework: 1) (Based

More information

Distributions of Continuous Data

Distributions of Continuous Data C H A P T ER Distributions of Continuous Data New cars and trucks sold in the United States average about 28 highway miles per gallon (mpg) in 2010, up from about 24 mpg in 2004. Some of the improvement

More information

2016 Fall Startup Event Thursday, September 29th, 2016

2016 Fall Startup Event Thursday, September 29th, 2016 This test consists of 100 problems to be solved in 30 minutes. All answers must be exact, complete, and in simplest form. To ensure consistent grading, if you get a decimal, mixed number, or ratio as any

More information

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 11 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 11 Notes Goals for this week (Tuesday) Linearity

More information

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below: Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have

More information

Introduction. CS243: Discrete Structures. Combinatorics. Product Rule. Basic Counting Rules. Example 2. Example 1

Introduction. CS243: Discrete Structures. Combinatorics. Product Rule. Basic Counting Rules. Example 2. Example 1 Introduction CS243: Discrete Structures Combinatorics Işıl Dillig Consider a set of objects and a property of interest Often, we want to know how many of these objects have the desired property Example:

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1 CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 1 Pimentel 141 Mccone

More information

Math 454 Final Exam, Fall 2005

Math 454 Final Exam, Fall 2005 c IIT Dept. Applied Mathematics, December 12, 2005 1 PRINT Last name: Signature: First name: Student ID: Math 454 Final Exam, Fall 2005 I. Examples, Counterexamples and short answer. (6 2 ea.) Do not give

More information

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics

[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics 400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {

More information

Math 6 Midterm Review Solutions

Math 6 Midterm Review Solutions Math Midterm Review Solutions 1. a statement b not a statement truth or falsity depends on the reference for the pronoun she c statement d not a statement truth or falsity depends on the reference for

More information

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Math 1324 Final Review Name SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Solve the system of two equations in two variables. 1) 8x + 9y = -20 3x +

More information

Math 574 Review Exam #1

Math 574 Review Exam #1 Math 574 Review Exam 1 1. How many 8-card hands, dealt from a standard deck of 5, consist of: (a). 5 of one suit and 3 of another suit? (b). 4 each of two suits. (c). 3 of one suit, 3 of a second suit,

More information

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus)

Math 302 Introduction to Proofs via Number Theory. Robert Jewett (with small modifications by B. Ćurgus) Math 30 Introduction to Proofs via Number Theory Robert Jewett (with small modifications by B. Ćurgus) March 30, 009 Contents 1 The Integers 3 1.1 Axioms of Z...................................... 3 1.

More information

1 VALLIAMMAI ENGINEERING COLLEGE (A member of SRM Group of Institutions) SRM Nagar, Kattankulathur 603203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year and Semester : IV/ VIII Section : CSE 1 & 2

More information

Summary of Course Coverage

Summary of Course Coverage CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities

More information

DISCRETE MATHEMATICS

DISCRETE MATHEMATICS DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

More information

CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions

CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam Sample Solutions Question 1: Cardinality How many distinct elements does the set S contain in each case? Check the appropriate

More information

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say

Sets 1. The things in a set are called the elements of it. If x is an element of the set S, we say Sets 1 Where does mathematics start? What are the ideas which come first, in a logical sense, and form the foundation for everything else? Can we get a very small number of basic ideas? Can we reduce it

More information

CS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010

CS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010 CS 3512, Spring 2011 Instructor: Doug Dunham Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010 Prerequisites: Calc I, CS2511 Rough course outline:

More information

Discrete Mathematics Lecture 4. Harper Langston New York University

Discrete Mathematics Lecture 4. Harper Langston New York University Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a

More information

(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1

(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1 CS 70 Discrete Mathematics for CS Fall 2000 Wagner MT1 Sol Solutions to Midterm 1 1. (16 pts.) Theorems and proofs (a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are

More information

CS 341 Homework 1 Basic Techniques

CS 341 Homework 1 Basic Techniques CS 341 Homework 1 Basic Techniques 1. What are these sets? Write them using braces, commas, numerals, (for infinite sets), and only. (a) ({1, 3, 5} {3, 1}) {3, 5, 7} (b) {{3}, {3, 5}, {{5, 7}, {7, 9}}}

More information

COT 3100 Spring 2010 Midterm 2

COT 3100 Spring 2010 Midterm 2 COT 3100 Spring 2010 Midterm 2 For the first two questions #1 and #2, do ONLY ONE of them. If you do both, only question #1 will be graded. 1. (20 pts) Give iterative and recursive algorithms for finding

More information

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2 2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of

More information

Data Management Page 1 of 12 Permutations Extra Problems (solutions)

Data Management Page 1 of 12 Permutations Extra Problems (solutions) Data Management Page of. a) How many -digit numbers can be formed using the digits 0,,,,, if no digits may be repeated in the number? remaining digits, including zero not zero {,,,, } b) How many of the

More information

CSE 131 Introduction to Computer Science Fall 2016 Exam I. Print clearly the following information:

CSE 131 Introduction to Computer Science Fall 2016 Exam I. Print clearly the following information: CSE 131 Introduction to Computer Science Fall 2016 Given: 29 September 2016 Exam I Due: End of Exam Session This exam is closed-book, closed-notes, no electronic devices allowed The exception is the "sage

More information

Week 12: Trees; Review. 22 and 24 November, 2017

Week 12: Trees; Review. 22 and 24 November, 2017 (1/24) MA284 : Discrete Mathematics Week 12: Trees; Review http://www.maths.nuigalway.ie/~niall/ma284/ 22 and 24 November, 2017 C C C C 1 Trees Recall... Applications: Chemistry Applications: Decision

More information

Assignment 4 Solutions of graph problems

Assignment 4 Solutions of graph problems Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of

More information

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;

The set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g; Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method

More information

Counting. Andreas Klappenecker

Counting. Andreas Klappenecker Counting Andreas Klappenecker Counting k = 0; for(int i=1; i

More information

MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability)

MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability) MATHEMATICS 191, FALL 2004 MATHEMATICAL PROBABILITY Outline #1 (Countability and Uncountability) Last modified: September 16, 2004 Reference: Apostol, Calculus, Vol. 2, section 13.19 (attached). The aim

More information

Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule

Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams Basic Counting Principles: The Product Rule

More information

Student name: Student ID: MATH 61 (Butler) Midterm II, 12 November 2008

Student name: Student ID: MATH 61 (Butler) Midterm II, 12 November 2008 Student name: Student ID: MATH 61 (Butler) Midterm II, 1 November 008 This test is closed book and closed notes, with the exception that you are allowed one 8 1 11 page of handwritten notes. No calculator

More information

Midterm 2. Friday, August 2, 5:10pm 7:10pm CS 70: Discrete Mathematics and Probability Theory, Summer 2013

Midterm 2. Friday, August 2, 5:10pm 7:10pm CS 70: Discrete Mathematics and Probability Theory, Summer 2013 Midterm 2 Friday, August 2, 5:10pm 7:10pm CS 70: Discrete Mathematics and Probability Theory, Summer 2013 Your name Your student ID # Your section # This exam has 5 questions and a total of 100 points.

More information

Topic 10 Part 2 [474 marks]

Topic 10 Part 2 [474 marks] Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed

More information

The Probabilistic Method

The Probabilistic Method The Probabilistic Method Po-Shen Loh June 2010 1 Warm-up 1. (Russia 1996/4 In the Duma there are 1600 delegates, who have formed 16000 committees of 80 persons each. Prove that one can find two committees

More information

Finnish National High School Mathematics Competition

Finnish National High School Mathematics Competition Finnish National High School Mathematics Competition Final Rounds 997 008 The Finnish National High School Mathematics Competition is organized by MAOL, the The Finnish Association of Teachers of Mathematics,

More information

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets. SETS A set is a file of objects which have at least one property in common. The objects of the set are called elements. Sets are notated with capital letters K, Z, N, etc., the elements are a, b, c, d,

More information

Counting. Chapter Basic Counting. The Sum Principle. We begin with an example that illustrates a fundamental principle.

Counting. Chapter Basic Counting. The Sum Principle. We begin with an example that illustrates a fundamental principle. Chapter 1 Counting 1.1 Basic Counting The Sum Principle We begin with an example that illustrates a fundamental principle. Exercise 1.1-1 The loop below is part of an implementation of selection sort,

More information

Place Value. Objectives To develop place-value concepts and connect place value in money with place value in base-10 blocks. Assessment Management

Place Value. Objectives To develop place-value concepts and connect place value in money with place value in base-10 blocks. Assessment Management Place Value Objectives To develop place-value concepts and connect place value in money with place value in base-10 blocks. www.everydaymathonline.com epresentations etoolkit Algorithms Practice EM Facts

More information

MATH 271 Summer 2016 Assignment 4 solutions

MATH 271 Summer 2016 Assignment 4 solutions MATH 7 ummer 06 Assignment 4 solutions Problem Let A, B, and C be some sets and suppose that f : A B and g : B C are functions Prove or disprove each of the following statements (a) If f is one-to-one

More information

Integers and Rational Numbers

Integers and Rational Numbers A A Family Letter: Integers Dear Family, The student will be learning about integers and how these numbers relate to the coordinate plane. The set of integers includes the set of whole numbers (0, 1,,,...)

More information

1/15 2/19 3/23 4/28 5/12 6/23 Total/120 % Please do not write in the spaces above.

1/15 2/19 3/23 4/28 5/12 6/23 Total/120 % Please do not write in the spaces above. 1/15 2/19 3/23 4/28 5/12 6/23 Total/120 % Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. Please make sure that you read through this entire exam

More information

AP Computer Science Principles Programming Question Tips. 1: Which algorithm/code segment achieves some result?

AP Computer Science Principles Programming Question Tips. 1: Which algorithm/code segment achieves some result? AP Computer Science Principles Programming Question Tips Name: Recall that roughly 40 percent of the questions on the AP exam will be programming or algorithm questions. These will often fall into one

More information

Discrete Mathematics Course Review 3

Discrete Mathematics Course Review 3 21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has

More information

CSE Discrete Structures

CSE Discrete Structures CSE 2315 - Discrete Structures Homework 3- Solution - Fall 2010 Due Date: Oct. 28 2010, 3:30 pm Sets 1. Rewrite the following sets as a list of elements. (8 points) a) {x ( y)(y N x = y 3 x < 30)} {0,

More information

Strategies for Proofs

Strategies for Proofs Strategies for Proofs Landscape with House and Ploughman Van Gogh Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 Goals of this lecture A bit more logic Reviewing Implication

More information

Section 3.2 Measures of Central Tendency MDM4U Jensen

Section 3.2 Measures of Central Tendency MDM4U Jensen Section 3.2 Measures of Central Tendency MDM4U Jensen Part 1: Video This video will review shape of distributions and introduce measures of central tendency. Answer the following questions while watching.

More information

Solutions to In-Class Problems Week 4, Fri

Solutions to In-Class Problems Week 4, Fri Massachusetts Institute of Technology 6.042J/18.062J, Fall 02: Mathematics for Computer Science Professor Albert Meyer and Dr. Radhika Nagpal Solutions to In-Class Problems Week 4, Fri Definition: The

More information

Computer Science 236 Fall Nov. 11, 2010

Computer Science 236 Fall Nov. 11, 2010 Computer Science 26 Fall Nov 11, 2010 St George Campus University of Toronto Assignment Due Date: 2nd December, 2010 1 (10 marks) Assume that you are given a file of arbitrary length that contains student

More information

Proof Techniques Alphabets, Strings, and Languages. Foundations of Computer Science Theory

Proof Techniques Alphabets, Strings, and Languages. Foundations of Computer Science Theory Proof Techniques Alphabets, Strings, and Languages Foundations of Computer Science Theory Proof By Case Enumeration Sometimes the most straightforward way to prove that a property holds for all elements

More information