Math 187 Sample Test II Questions

Size: px
Start display at page:

Download "Math 187 Sample Test II Questions"

Transcription

1 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! This document is much longer than your test. I will distribute solutions to some of these later (maybe not all, as there is a quite a lot of duplication of kinds of question). There are some parts of questions which require ideas from section 17, which will not be on this test. 1. Venn diagrams (a) Illustrate the identity A (B C) = (A B) (A C) using Venn diagrams. Clearly label all sets in your diagrams, using keys to shadings or colors when appropriate. Clearly indicate which set in each diagram is the final result. (b) The equation A (B C) = (A B) (A C) is not an identity. Find finite sets A, B, C for which this equation is not true (and show by calculation that it is not true for these sets). You can use a Venn diagram to help find a counterexample, as we discussed in class. 2. A state has license plates consisting of four letters followed by three digits. 1

2 You need to set up calculations for your answers to this problem, but if you don t have a calculator (or if the number is too large for your calculator) the set-up by itself is enough. (a) If no additional conditions are imposed, how many license plates are possible? (b) How many license plates are possible if no letter can appear more than once and no digit can be followed immediately by the same digit? (c) How many license plates are possible if repetitions of letters and digits are allowed and at least one A or at least one 8 appears on the plate? Hint: think about plates which contain neither an A nor an Sets and set notation (a) Write the set {x Z 4 x x 16} in the notation which lists all its elements. (b) Write the set {x x {1, 2, 3} x 2} in the notation which lists all of its elements. Hint: this set has four elements, and the elements are sets, not numbers. 2

3 (c) Consider the two statements for all sets A, B, and C, if A B and B C, then A C and for all sets A, B, and C, if A B and B C, then A C. One of these statements is true: tell me which one (you do not need to prove it). Give examples of sets A, B, C which are a counterexample to the other statement. 4. License plates for a small state consist of three letters (A Z) followed by three digits (0 9). Show the setup for your calculations and give the final answer if you have a calculator. (a) How many license plates are possible if no other conditions are imposed? (b) How many license plates are possible if no letter can appear more than once on the plate and no digit can be immediately followed by the same digit? (c) Allowing unlimited repetitions, how many license plates contain at least one letter A? 5. Set theory notation: in each of the following sentences, write (is a member of) or (is a subset of) as appropriate. (a) 2 {1, 2, 3} (b) {1, 2, 3, 4} (c) {1, 2} {1, 2} (d) {1} {{1}} 6. (a) How many anagrams can be made from the word ABRACADABRA? Set this up in terms of factorials then compute it. 3

4 (b) A chain of beads is to be made with 12 beads, 4 beads of each of 3 different colors. How many different ways are there to do this? Set this up and compute it. 7. (a) A committee with 20 members is to choose a subcommittee with 5 members. How many ways are there to do this? (Set up and compute actual number). (b) A committee with 20 members is to choose a committee with 5 members which will have a chair and a secretary. How many ways are there to do this? (Set up and compute actual numbers). (c) A committee of 12 members is to divide itself into 3 working groups each with 4 members. How many ways are there to do this if the groups are labelled Rules, Membership, Finance? How many ways are there to do this if the groups have no special identifiers? Set up and compute actual numbers. 8. Write the first four terms of the expansion of (x+y) 20. Set this up using binomial coefficients, then evaluate the coefficients as actual numbers. 9. As is so often the case in my tests and examples, members of a group of 21 students are all enrolled in at least one of Math, French and English. 10 students take Math. 9 students take French. 13 students take English. 3 students take Math and French. 6 students take English and Math. 4 students take English and French. Either compute the number of students taking all three courses or prove that I am lying. Your solution must use the inclusion-exclusion principle: set up your work in such a way that I can clearly see that you used it. 4

5 Write the inclusion-exclusion formula for A B C D, where A, B, C, D are any four sets. 10. Consider the relation x F y on integers defined as 5 (x y). Write out the three things you need to prove to show that this is an equivalence relation (your answer must not depend on my knowing what words like reflexive, symmetric, and transitive mean: show me that you know what they mean). Prove one of them (if you prove more your best effort will count, and you might get a little extra credit). If the relation is restricted to the numbers between 1 and 20 inclusive, write out the equivalence classes under this relation (hint: numbers are equivalent if they have the same remainder on division by 5). 11. Give a demonstration of the theorem A (B C) = (A B) (A C) using Venn diagrams. Provide keys to your diagrams and clearly indicate the sets which are the final answers. 5

6 12. Write down the equivalence classes for the equivalence relation x R y defined as x y is divisible by 4 on the set of positive integers less than or equal to 20 (these are sets). 13. In how many different ways can the letters in REARRANGED be rearranged? Set up your answer in terms of factorials then compute an actual number. 14. You have a bin containing 12 beads of each of 4 different colors. You are going to make an open chain of just 12 beads (not 48). In each part set up your answer in terms of powers, factorials or binomial coefficients (as appropriate) then compute an actual number. (a) How many different chains of 12 beads with 3 of each color can you make? (b) How many handfuls of 12 beads of assorted colors are possible (here all that matters is how many beads you have of each color)? (c) How many chains of 12 beads of any mixture of colors are possible? 15. A committee of 10 people is appointing a subcommittee of 5 people. In each part, set up your calculation using binomial coefficients then compute an actual number. The last part is of course unrelated, but you still need to show your answer first using binomial coefficients then using actual numbers. (a) How many subcommittees of 5 are possible? 6

7 (b) Suppose we also need to specify a chair and a secretary from among the members of the subcommittee. How many possible ways are there to choose a 5 member subcommittee with chair and secretary? (c) Compute the first four terms of the expansion of (x + y) Of a group of 26 students, all must take English, Math, or French. 12 take English, 14 take Math, 14 take French. 7 take English and French, 3 take English and Math, 6 take French and Math. How many are taking all three subjects? You must set up and solve the problem in a way which demonstrates that you understand the Inclusion-Exclusion Principle. 17. Proofs. Do one of the following: if you do both, you will be graded on your best work. If you do very well on both you might get some extra credit. (a) Prove that the relation x R y on integers defined by x y is dvisible by 4 is an equivalence relation. There are three things to prove: set them up and identify each with an appropriate name, then prove them. (b) Prove using the appropriate proof templates from the book that for any sets A, B, C, if A B and B C then A C. Of course this is obvious, and you do not get noticeable credit for an informal explanation of the obvious; what is wanted is a formal proof in the style of the book or my board examples. 18. Venn diagrams (a) Give a pair of Venn diagrams illustrating the truth of A (B C) = (A B) (A C) Be sure to include a key to help me understand the shadings you use and to outline the final result sets clearly. 7

8 (b) Give a pair of Venn diagrams illustrating the fact that A (B C) = (A B) C is false, and give explicit examples of finite sets A, B, C for which it is false (your diagram can help you do this). 19. List all partitions of {1, 2, 3, 4} (a partition of a set A is a set of nonempty subsets of A such that each element of A belongs to exactly one element of the partition). 20. How many different anagrams can be made from the word ANAGRAMS? From the word DIFFERENT? 21. You want to make a necklace with 20 beads of 5 different colors. The necklace has a clasp past which beads can t be moved. How many ways can the necklace be made if you have 4 beads of each color? How does this change if there is no clasp, so beads can be moved freely all the way around the necklace? Suppose for the rest of the problem that you have 20 beads of each color (so you can use as many beads of each color as you like, but still no more than 20 beads in the necklace in all)? In how many ways can you choose a handful of 20 beads to put on the 8

9 necklace (this is just a handful, order doesn t matter). In how many ways can you make a necklace of 20 beads? 22. How many subcommittees with five members can be formed from a committee with ten members? How many ways can the subcommittees be chosen if each subcommittee has a chair and a treasurer chosen from among its five members? Write the first four terms of the expansion of (x + y) 1 0 (here I do want the coefficients fully computed, not just set up, and certainly not in binomial coefficient notation). 23. At a foreign language institute, 16 students study French, 19 study German, 17 study Russian, 8 study French and German, 7 study German and Russian, 9 study French and Russian. Of the 31 students, how many study all three languages? You are required to set this up and solve it using the inclusion-exclusion method, in a way which makes it clear that you understand this method. 24. Properties of relations (a) Consider the relation x is a full sibling of y on human beings (x and y are brothers or sisters, excluding half-brothers and halfsisters). Is this relation reflexive? irreflexive? symmetric? an- 9

10 tisymmetric? transitive? Explain each of your answers briefly. Some of these are mildly tricky. (b) Consider the relation x T y on integers defined by 3 (x y) (x y is divisible by 3, or x y mod 3). Prove that this is an equivalence relation (there are three things you need to prove: list them (clearly identifying them by name) and prove them). List the equivalence classes under this relation if we restrict our attention to positive integers less than

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

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

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

CHAPTER 8. Copyright Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation

More information

Discrete Mathematics Exam File Fall Exam #1

Discrete Mathematics Exam File Fall Exam #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

More information

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

My dear students, Believe in yourselves. Believe in your abilities. You have got this! -Dr. M

My dear students, Believe in yourselves. Believe in your abilities. You have got this! -Dr. M 1/20 2/10 3/7 4/18 5/10 6/6 7/17 8/12 Total/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. You must show all work, or risk losing credit. Be

More information

Algebra of Sets (Mathematics & Logic A)

Algebra of Sets (Mathematics & Logic A) Algebra of Sets (Mathematics & Logic A) RWK/MRQ October 28, 2002 Note. These notes are adapted (with thanks) from notes given last year by my colleague Dr Martyn Quick. Please feel free to ask me (not

More information

9.5 Equivalence Relations

9.5 Equivalence Relations 9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same

More information

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall

2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members

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

11 Sets II Operations

11 Sets II Operations 11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric

More information

10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings

10/11/2018. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings. Partial Orderings Sometimes, relations define an order on the elements in a set. Definition: A relation R on a set S is called a partial ordering or partial order if it is reflexive, antisymmetric, and transitive. A set

More information

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

ELEMENTARY NUMBER THEORY AND METHODS OF PROOF CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.2 Direct Proof and Counterexample II: Rational Numbers Copyright Cengage Learning. All

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

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

Notebook Assignments

Notebook Assignments Notebook Assignments These six assignments are a notebook using techniques from class in the single concrete context of graph theory. This is supplemental to your usual assignments, and is designed for

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

Binary Relations McGraw-Hill Education

Binary Relations McGraw-Hill Education Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent

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

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

Relations I. Margaret M. Fleck. 7 November 2008

Relations I. Margaret M. Fleck. 7 November 2008 Relations I Margaret M. Fleck 7 November 2008 This lecture covers relations and basic properties of relations, which is most of section 8.1 of Rosen. 1 Announcements Model solutions for the second midterm

More information

Lattice Tutorial Version 1.0

Lattice Tutorial Version 1.0 Lattice Tutorial Version 1.0 Nenad Jovanovic Secure Systems Lab www.seclab.tuwien.ac.at enji@infosys.tuwien.ac.at November 3, 2005 1 Introduction This tutorial gives an introduction to a number of concepts

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

Semantics via Syntax. f (4) = if define f (x) =2 x + 55.

Semantics via Syntax. f (4) = if define f (x) =2 x + 55. 1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)

More information

1.1 - Introduction to Sets

1.1 - Introduction to Sets 1.1 - Introduction to Sets Math 166-502 Blake Boudreaux Department of Mathematics Texas A&M University January 18, 2018 Blake Boudreaux (Texas A&M University) 1.1 - Introduction to Sets January 18, 2018

More information

Math 221 Final Exam Review

Math 221 Final Exam Review Math 221 Final Exam Review Preliminary comment: Some of these problems a formulated using language and structures from graph theory. However they are generally self contained; no theorems from graph theory

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

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

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper.

Algebra of Sets. Aditya Ghosh. April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. Algebra of Sets Aditya Ghosh April 6, 2018 It is recommended that while reading it, sit with a pen and a paper. 1 The Basics This article is only about the algebra of sets, and does not deal with the foundations

More information

My dear students, Believe in yourselves. Believe in your abilities. You can DO this! -Dr. M

My dear students, Believe in yourselves. Believe in your abilities. You can DO this! -Dr. M 1/29 2/22 3/12 4/8 5/9 6/20 otal/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. You must show all work, or risk losing credit. Be sure to answer

More information

Recursively Enumerable Languages, Turing Machines, and Decidability

Recursively Enumerable Languages, Turing Machines, and Decidability Recursively Enumerable Languages, Turing Machines, and Decidability 1 Problem Reduction: Basic Concepts and Analogies The concept of problem reduction is simple at a high level. You simply take an algorithm

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

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 Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.

Math Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both. Math 166 Fall 2006 c Heather Ramsey Page 1 Math 166 - Week in Review #5 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that can

More information

Set and Set Operations

Set and Set Operations Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to

More information

CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4

CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4 CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the

More information

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation

More information

Congruence Arithmetic

Congruence Arithmetic Module 4 Congruence Arithmetic Popper 4 Introduction to what is like Modulus choices Partitions by modulus Mod 5 Mod 7 Mod 30 Modular Arithmetic Addition Subtraction Multiplication INTEGERS! Mod 12 Cayley

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

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

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

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31 Sets MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Sets Fall 2014 1 / 31 Outline 1 Sets Introduction Cartesian Products Subsets Power Sets Union, Intersection, Difference

More information

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5

Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can

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

1 of 7 7/15/2009 3:40 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 1. Sets Poincaré's quote, on the title page of this chapter could not be more wrong (what was he thinking?). Set theory

More information

AXIOMS FOR THE INTEGERS

AXIOMS FOR THE INTEGERS AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,

More information

Math Exam 2 Solutions. Problem 1 (8 points) Problem 2 (8 points) Problem 3 (12 points) Problem 4 (26 points) Problem 5 (14 points)

Math Exam 2 Solutions. Problem 1 (8 points) Problem 2 (8 points) Problem 3 (12 points) Problem 4 (26 points) Problem 5 (14 points) Math 400 - Exam 2 Solutions Name: ID: Problem 1 (8 points) Problem 2 (8 points) Problem 3 (12 points) Problem 4 (26 points) Problem 5 (14 points) Problem 6 (6 points) Problem 7 (12 points) Problem 8 (14

More information

MITOCW watch?v=kvtlwgctwn4

MITOCW watch?v=kvtlwgctwn4 MITOCW watch?v=kvtlwgctwn4 PROFESSOR: The idea of congruence was introduced to the world by Gauss in the early 18th century. You've heard of him before, I think. He's responsible for some work on magnetism

More information

Math Week in Review #5

Math Week in Review #5 Math 141 Spring 2006 c Heather Ramsey Page 1 Math 141 - Week in Review #5 Section 4.1 - Simplex Method for Standard Maximization Problems A standard maximization problem is a linear programming problem

More information

CSC Discrete Math I, Spring Sets

CSC Discrete Math I, Spring Sets CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its

More information

Introduction to Modular Arithmetic

Introduction to Modular Arithmetic Randolph High School Math League 2014-2015 Page 1 1 Introduction Introduction to Modular Arithmetic Modular arithmetic is a topic residing under Number Theory, which roughly speaking is the study of integers

More information

If a b or a c, then a bc If a b and b c, then a c Every positive integer n > 1 can be written uniquely as n = p 1 k1 p 2 k2 p 3 k3 p 4 k4 p s

If a b or a c, then a bc If a b and b c, then a c Every positive integer n > 1 can be written uniquely as n = p 1 k1 p 2 k2 p 3 k3 p 4 k4 p s Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 1900 (Tarnoff) Math for Computer Science TEST 1 for Summer Term,

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

9. MATHEMATICIANS ARE FOND OF COLLECTIONS

9. MATHEMATICIANS ARE FOND OF COLLECTIONS get the complete book: http://wwwonemathematicalcatorg/getfulltextfullbookhtm 9 MATHEMATICIANS ARE FOND OF COLLECTIONS collections Collections are extremely important in life: when we group together objects

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

Preparation for Precalculus

Preparation for Precalculus Preparation for Precalculus Congratulations on your acceptance to the Governor s School of Southside Virginia (GSSV). I look forward to working with you as your mathematics instructor. I am confident that

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

Math 485, Graph Theory: Homework #3

Math 485, Graph Theory: Homework #3 Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the

More information

University of Toronto Department of Mathematics

University of Toronto Department of Mathematics University of Toronto Department of Mathematics MAT332H1F, Graph Theory Midterm, October 21, 2014 Instructor: Kasra Rafi First Last Student Number Instructions: No aids allowed. Write solutions on the

More information

CS1800 Discrete Structures Fall 2017 October 25, CS1800 Discrete Structures Midterm Version B

CS1800 Discrete Structures Fall 2017 October 25, CS1800 Discrete Structures Midterm Version B CS1800 Discrete Structures Fall 2017 October 25, 2017 Instructions: CS1800 Discrete Structures Midterm Version B 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic

More information

Relations, Equivalence Relations, and Partial Orders

Relations, Equivalence Relations, and Partial Orders Massachusetts Institute of Technology Lecture 6 6.042J/18.062J: Mathematics for Computer Science February 17, 2000 Professors David Karger and Nancy Lynch Relations, Equivalence Relations, and Partial

More information

1 Sets, Fields, and Events

1 Sets, Fields, and Events CHAPTER 1 Sets, Fields, and Events B 1.1 SET DEFINITIONS The concept of sets play an important role in probability. We will define a set in the following paragraph. Definition of Set A set is a collection

More information

Excerpt from "Art of Problem Solving Volume 1: the Basics" 2014 AoPS Inc.

Excerpt from Art of Problem Solving Volume 1: the Basics 2014 AoPS Inc. Chapter 5 Using the Integers In spite of their being a rather restricted class of numbers, the integers have a lot of interesting properties and uses. Math which involves the properties of integers is

More information

Ramsey s Theorem on Graphs

Ramsey s Theorem on Graphs Ramsey s Theorem on Graphs 1 Introduction Exposition by William Gasarch Imagine that you have 6 people at a party. We assume that, for every pair of them, either THEY KNOW EACH OTHER or NEITHER OF THEM

More information

MATH 2100 / 2105 / 2350 EXAM 1

MATH 2100 / 2105 / 2350 EXAM 1 MATH 2100 / 2105 / 2350 EXAM 1 Name: Wednesday, February 20 Instructions: Please write your work neatly and clearly. You must explain all reasoning. It is not sufficient to just write the correct answer.

More information

Theory Bridge Exam Example Questions Version of June 6, 2008

Theory Bridge Exam Example Questions Version of June 6, 2008 Theory Bridge Exam Example Questions Version of June 6, 2008 This is a collection of sample theory bridge exam questions. This is just to get some idea of the format of the bridge exam and the level of

More information

Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore

Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore Lecture - 5 Elementary concepts and basic counting principles So, welcome

More information

CMPSCI 311: Introduction to Algorithms Practice Final Exam

CMPSCI 311: Introduction to Algorithms Practice Final Exam CMPSCI 311: Introduction to Algorithms Practice Final Exam Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more detail including

More information

Module 2 Congruence Arithmetic pages 39 54

Module 2 Congruence Arithmetic pages 39 54 Module 2 Congruence Arithmetic pages 9 5 Here are some excellent websites that can help you on this topic: http://mathcentral.uregina.ca/qq/database/qq.09.98/kupper1.html http://nrich.maths.org/public.viewer.php?obj_id=50

More information

Slide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng

Slide Set 1. for ENEL 339 Fall 2014 Lecture Section 02. Steve Norman, PhD, PEng Slide Set 1 for ENEL 339 Fall 2014 Lecture Section 02 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2014 ENEL 353 F14 Section

More information

Abe Mirza Test 1 Review & Practice Math 1. List all the elements for: 1. B C 2. B A 3. C B. Draw the Venn diagram and shade the proper region for,

Abe Mirza Test 1 Review & Practice Math 1. List all the elements for: 1. B C 2. B A 3. C B. Draw the Venn diagram and shade the proper region for, Abe Mirza Test 1 Review & Practice Math 1 Let = {,,, a c e g, k, m, p,} s A= {,,,} a c e k B = {, ck, ps,} = {, k m, p} List all the elements for: 1. B 1) 2. B A 2) 3. B 3) 4. A ( B ) 4) 5. A ( B ) 5)

More information

Notes on Turing s Theorem and Computability

Notes on Turing s Theorem and Computability Notes on Turing s Theorem and Computability Walter Neumann About 60 years ago there was a revolution in mathematics and philosophy. First Gödel and then Turing showed that there are impossible problems

More information

2 Review of Set Theory

2 Review of Set Theory 2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply

More information

COMP260 Spring 2014 Notes: February 4th

COMP260 Spring 2014 Notes: February 4th COMP260 Spring 2014 Notes: February 4th Andrew Winslow In these notes, all graphs are undirected. We consider matching, covering, and packing in bipartite graphs, general graphs, and hypergraphs. We also

More information

Section 1.1 Patterns in Division

Section 1.1 Patterns in Division Section 1.1 Patterns in Division Divisibility refers to whether or not a number is divisible by another number. If a number divides evenly into another number (no remainder), then it is divisible by that

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

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

4.1 Review - the DPLL procedure

4.1 Review - the DPLL procedure Applied Logic Lecture 4: Efficient SAT solving CS 4860 Spring 2009 Thursday, January 29, 2009 The main purpose of these notes is to help me organize the material that I used to teach today s lecture. They

More information

1 Elementary number theory

1 Elementary number theory Math 215 - Introduction to Advanced Mathematics Spring 2019 1 Elementary number theory We assume the existence of the natural numbers and the integers N = {1, 2, 3,...} Z = {..., 3, 2, 1, 0, 1, 2, 3,...},

More information

Sets. Margaret M. Fleck. 15 September 2010

Sets. Margaret M. Fleck. 15 September 2010 Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that

More information

Chapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Chapter Summary Mathematical Induction Recursive Definitions Structural Induction Recursive Algorithms Section 5.1 Sec.on Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken

More information

Provide a drawing. Mark any line with three points in blue color.

Provide a drawing. Mark any line with three points in blue color. Math 3181 Name: Dr. Franz Rothe August 18, 2014 All3181\3181_fall14h1.tex Homework has to be turned in this handout. For extra space, use the back pages, or blank pages between. The homework can be done

More information

Relations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.

Relations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among

More information

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Math 3181 Dr. Franz Rothe Name: All3181\3181_spr13t1.tex 1 Solution of Test I Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Definition

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

Binary Relations Part One

Binary Relations Part One Binary Relations Part One Outline for Today Binary Relations Reasoning about connections between objects. Equivalence Relations Reasoning about clusters. A Fundamental Theorem How do we know we have the

More information

1 Linear programming relaxation

1 Linear programming relaxation Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Primal-dual min-cost bipartite matching August 27 30 1 Linear programming relaxation Recall that in the bipartite minimum-cost perfect matching

More information

ANS:

ANS: Math 15-Spring 17-Final Exam Solutions 1. Consider the following definition of the symbol. Definition. Let x and y be integers. Write x y if 5x + 7y = 11k for some integer k. (a) Show that 1 4, 2 8, and

More information

4.3, Math 1410 Name: And now for something completely different... Well, not really.

4.3, Math 1410 Name: And now for something completely different... Well, not really. 4.3, Math 1410 Name: And now for something completely different... Well, not really. How derivatives affect the shape of a graph. Please allow me to offer some explanation as to why the first couple parts

More information

Math 7 Notes Unit 2B: Rational Numbers

Math 7 Notes Unit 2B: Rational Numbers Math 7 Notes Unit B: Rational Numbers Teachers Before we move to performing operations involving rational numbers, we must be certain our students have some basic understandings and skills. The following

More information

The Intersection of Two Sets

The Intersection of Two Sets Venn Diagrams There are times when it proves useful or desirable for us to represent sets and the relationships among them in a visual manner. This can be beneficial for a variety of reasons, among which

More information

Computer Science Foundation Exam

Computer Science Foundation Exam Computer Science Foundation Exam May 8, 2015 Section II B DISCRETE STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question Max Pts Category Passing

More information

Bulgarian Math Olympiads with a Challenge Twist

Bulgarian Math Olympiads with a Challenge Twist Bulgarian Math Olympiads with a Challenge Twist by Zvezdelina Stankova Berkeley Math Circle Beginners Group September 0, 03 Tasks throughout this session. Harder versions of problems from last time appear

More information

MATH 22 MORE ABOUT FUNCTIONS. Lecture M: 10/14/2003. Form follows function. Louis Henri Sullivan

MATH 22 MORE ABOUT FUNCTIONS. Lecture M: 10/14/2003. Form follows function. Louis Henri Sullivan MATH 22 Lecture M: 10/14/2003 MORE ABOUT FUNCTIONS Form follows function. Louis Henri Sullivan This frightful word, function, was born under other skies than those I have loved. Le Corbusier D ora innanzi

More information

Solve the matrix equation AX B for X by using A.(1-3) Use the Inverse Matrix Calculator Link to check your work

Solve the matrix equation AX B for X by using A.(1-3) Use the Inverse Matrix Calculator Link to check your work Name: Math 1324 Activity 9(4.6)(Due by Oct. 20) Dear Instructor or Tutor, These problems are designed to let my students show me what they have learned and what they are capable of doing on their own.

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

Lecture 6,

Lecture 6, Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus

More information

Propositional Logic. Part I

Propositional Logic. Part I Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.

More information

COUNTING AND PROBABILITY

COUNTING AND PROBABILITY CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.3 Counting Elements of Disjoint Sets: The Addition Rule Copyright Cengage Learning. All rights reserved. Counting

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