COUNTING SUBSETS OF A SET: COMBINATIONS


 Jocelyn McDaniel
 1 years ago
 Views:
Transcription
1 COUNTING SUBSETS OF A SET: COMBINATIONS DEFINITION 1: Let n, r be nonnegative integers with r n. An rcombination of a set of n elements is a subset of r of the n elements. EXAMPLE 1: Let S {a, b, c, d}. Then the 1combinations are : {a}, {b}, {c}, {d} the combinations are : {a, b}, {a, c}, {a, d}, {b, c}, {b, d}, {c, d} the combinations are : {a, b, c}, {a, b, d}, {a, c, d}, {b, c, d} the combination is : {a, b, c, d}. DEFINITION : n The symbol, read n choose r, denotes the number of rcombinations that can be r chosen from a set of n elements. EXAMPLE : It follows from Example 1 that, 6,, 1 1. THEOREM: Let n, r be nonnegative integers with r n. Then n n! r r! (n r)!. EXAMPLE : We have!! ( )!!!! 1 (1 ) (1 ) 1 6,!! ( )!!! 1! 1 (1 ) 1 1,!! ( )!!! 0! 1 (1 ) , 8 8!! (8 )! 8!!! (1 ) (1 )
2 PROBLEMS: 1. Suppose members of a group of 1 are to be chosen to work as a team on a special project. How many distinct person teams can be formed?. Suppose two members of the group of 1 insist on working as a pair any team must either contain both or neither. How many distinct person teams can be formed?. Suppose two members of the group of 1 refuse to work together on a team. How many distinct person teams can be formed?. Suppose the group of 1 consists of men and women. (a) How many person teams can be chosen that consist of men and women? (b) How many person teams contain at least one man? (c) How many person teams contain at most one man?. Consider various ways of ordering the letters in the word MISSISSIPPI: IIMSSPISSIP, ISSSPMIIPIS, PIMISSSSIIP, and so on. How many distinguishable orderings are there?
3 SOLUTIONS: 1. Suppose members of a group of 1 are to be chosen to work as a team on a special project. How many distinct person teams can be formed? Solution: The number of distinct person teams is the same as the number of subsets of size (or combinations) that can be chosen from the set of 1. This number is 1 1!! (1 )! 1! !! (1 ) (1 6 ) Suppose two members of the group of 1 insist on working as a pair any team must either contain both or neither. How many distinct person teams can be formed? Solution: Call the two members of the group that insist on working as a pair A and B. Then any team formed must contain or neither A nor B. By Theorem 1 (The Addition Rule) we have: number of person teams containing or neither A nor B number of person teams containing + number of person teams containing neither A nor B Because a team that contains contains exactly other people from the remaining 10 in the group, there are as many such teams as there are subsets of people that can be chosen from the remaining 10. This number is 10 10!! (10 )! 10!!! (1 ) (1 6 ) Similarly, because a team that contains neither A nor B contains exactly people from the remaining 10 in the group, there are as many such teams as there are subsets of people that can be chosen from the remaining 10. This number is 10 10!! (10 )! 10!!! (1 ) (1 ) Therefore, number of person teams containing or neither A nor B 10 +.
4 . Suppose two members of the group of 1 refuse to work together on a team. How many distinct person teams can be formed? Solution: Call the two members of the group that refuse to work together A and B. By Theorem (The Difference Rule) we have: number of person teams [ number of person teams total number of that don t contain that contain person teams Suppose the group of 1 consists of men and women. (a) How many person teams can be chosen that consist of men and women? (b) How many person teams contain at least one man? (c) How many person teams contain at most one man? Solution: (a) Note, that there are ways to choose the three men out of the five and ways to choose the two women out of the seven. Therefore, by The Multiplication Rule we have: [ number of person teams that 10. contain men and women (b) By Theorem (The Difference Rule) we have: [ [ [ number of person teams total number number of person teams with at least one man of person teams that do not contain any men Now a person team with no men consists of women chosen from the seven women in the group. So, there are 1 such teams. Also, the total number of person teams is 1 9. Therefore, [ number of person teams with at least one man (c) By Theorem 1 (The Addition Rule) we have: [ [ number of person teams number of person teams with at most one man without any men. [ number of person teams + with one man Now a person team without any men consists of women chosen from the women in the group. So, there are 1 such teams. Also, by The Multiplication Rule there are 1 teams with one man. Therefore, 1 [ number of person teams with at most one man.
5 . Consider various ways of ordering the letters in the word MISSISSIPPI: IIMSSPISSIP, ISSSPMIIPIS, PIMISSSSIIP, and so on. How many distinguishable orderings are there? Solution: Since there are 11 positions in all, there are 11 subsets of positions for the S s. Once the four S s are in place, there are subsets of positions for the I s. After the I s are in place, there are subsets of positions for the P s. That leaves just one position for the M. Hence, by The Multiplication Rule we have: [ number of ways to position all the letters 11, 60.
Chapter 7: Section 73 Permutations
Chapter 7: Section 73 Permutations D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE ()Chapter 7: Section 73 Permutations 1 / 13 Permutations Suppose that you are
More informationSection 6.4: Counting Subsets of a Set: Combinations
Section 6.4: Counting Subsets of a Set: Combinations In section 6.2, we learnt how to count the number of rpermutations from an nelement set (recall that an rpermutation is an ordered selection of r
More informationDiscrete Mathematics Lecture 5. Harper Langston New York University
Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = 1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of
More informationDiscrete Mathematics: Homework 6 Due:
Discrete Mathematics: Homework 6 Due: 2011.05.20 1. (3%) How many bit strings are there of length six or less? We use the sum rule, adding the number of bit strings of each length to 6. If we include the
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationSpring 2007 Math 510 Hints for practice problems
Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an chessboard There are doors between all adjacent cells A prisoner in one
More informationPossibilities and Probabilities
Possibilities and Probabilities Counting The Basic Principle of Counting: Suppose that two experiments are to be performed. Then if experiment 1 can result in any one of m possible outcomes and if, for
More information4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.
Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,
More informationSolution, Assignment #6, CSE 191 Fall, 2014
Solution, Assignment #6, CSE 191 Fall, 2014 General Guidelines: This assignment will NOT be collected, nor graded. However, you should carefully complete it as if it were to be graded. There will be a
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationSets, Venn Diagrams & Counting
MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised January 5, 2011 What is a set? Sets set is a collection of objects. The objects in the set are called elements of
More informationSOLUTIONS, Homework 6
SOLUTIONS, Homework 6 1. Testing out the identities from Section 6.4. (a) Write out the numbers in the first nine rows of Pascal s triangle. 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationSets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.
Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in
More informationECE316 Tutorial for the week May 1115
ECE316 Tutorial for the week May 1115 Problem 4: Page 16  (Refer to lecture notes part 1 slide 14,16) John, Jim, Jay and Jack have formed a band consisting of 4 instruments. If each of the boys can
More informationA1. Basic Reviews PERMUTATIONS and COMBINATIONS... or HOW TO COUNT
A1. Basic Reviews Appendix / A1. Basic Reviews / Perms & Combos1 PERMUTATIONS and COMBINATIONS... or HOW TO COUNT Question 1: Suppose we wish to arrange n 5 people {a, b, c, d, e}, standing side by side,
More information2.1 Sets, power sets. Cartesian Products.
Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects.  used to group objects together,  often the objects with similar properties This description of a set (without
More informationLecture 6: Probability. If S is a sample space with all outcomes equally likely, define the probability of event E,
Lecture 6: Probability Example Sample Space set of all possible outcomes of a random process Flipping 2 coins Event a subset of the sample space Getting exactly 1 tail Enumerate Sets If S is a sample space
More informationFoundations of Computing Discrete Mathematics Solutions to exercises for week 2
Foundations of Computing Discrete Mathematics Solutions to exercises for week 2 Agata Murawska (agmu@itu.dk) September 16, 2013 Note. The solutions presented here are usually one of many possiblities.
More informationSection 2.7 OnetoOne Functions and Their Inverses
Section. OnetoOne Functions and Their Inverses OnetoOne Functions HORIZONTAL LINE TEST: A function is onetoone if and only if no horizontal line intersects its graph more than once. EXAMPLES: 1.
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Colin Stirling Informatics Slides originally by Kousha Etessami Colin Stirling (Informatics) Discrete Mathematics (Chapter 6) Today 1 /
More informationCHAPTER 2. Inequalities
CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationSets and set operations
CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used
More informationComputer Algebra for Computer Engineers
p.1/14 Computer Algebra for Computer Engineers Preliminaries Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/14 Notation R: Real Numbers Q: Fractions
More information2. INEQUALITIES AND ABSOLUTE VALUES
2. INEQUALITIES AND ABSOLUTE VALUES 2.1. The Ordering of the Real Numbers In addition to the arithmetic structure of the real numbers there is the order structure. The real numbers can be represented by
More informationDimitris Chatzidimitriou. Corelab NTUA. June 28, 2013
AN EFFICIENT ALGORITHM FOR THE OPTIMAL STABLE MARRIAGE PROBLEM Dimitris Chatzidimitriou Corelab NTUA June 28, 2013 OUTLINE 1 BASIC CONCEPTS 2 DEFINITIONS 3 ROTATIONS 4 THE ALGORITHM DIMITRIS CHATZIDIMITRIOU
More informationFormal Languages and Automata Theory  Regular Expressions and Finite Automata 
Formal Languages and Automata Theory  Regular Expressions and Finite Automata  Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More information(IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems.
3130CIT: Theory of Computation Turing machines and undecidability (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems. An undecidable problem
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationModule 6: Basic Counting
Module 6: Basic Counting Theme 1: Basic Counting Principle We start with two basic counting principles, namely, the sum rule and the multiplication rule. The Sum Rule: If there are n 1 different objects
More informationSets and Subsets. Countable and Uncountable
Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 5
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 5 Modular Arithmetic One way to think of modular arithmetic is that it limits numbers to a predefined range {0,1,...,N
More information2.1 Symbols and Terminology
2.1 Symbols and Terminology Definitions: set is a collection of objects. The objects belonging to the set are called elements, ormembers, oftheset. Sets can be designated in one of three different ways:
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More information1.4 Factors and Prime Factorization
1.4 Factors and Prime Factorization Recall from Section 1.2 that the word factor refers to a number which divides into another number. For example, 3 and 6 are factors of 18 since 3 6 = 18. Note also that
More informationHoover High School Math League. Counting and Probability
Hoover High School Math League Counting and Probability Problems. At a sandwich shop there are 2 kinds of bread, 5 kinds of cold cuts, 3 kinds of cheese, and 2 kinds of dressing. How many different sandwiches
More information1 Combinations, Permutations, and Elementary Probability
1 Combinations, Permutations, and Elementary Probability Roughly speaking, Permutations are ways of grouping things where the order is important. Combinations are ways of grouping things where the order
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationDiagonal, Symmetric and Triangular Matrices
Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationA set is an unordered collection of objects.
Section 2.1 Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the elements, or members of the set. A set is said to contain
More informationThe Basics of Counting. Niloufar Shafiei
The Basics of Counting Niloufar Shafiei Counting applications Counting has many applications in computer science and mathematics. For example, Counting the number of operations used by an algorithm to
More informationA Problem With The Rational Numbers
Solvability of Equations Solvability of Equations 1. In fields, linear equations ax + b = 0 are solvable. Solvability of Equations 1. In fields, linear equations ax + b = 0 are solvable. 2. Quadratic equations
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H1088 Budapest, Múzeum krt. 68. CONTENTS 1. SETS Set, equal sets, subset,
More information. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9
Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a
More informationLESSON 1 PRIME NUMBERS AND FACTORISATION
LESSON 1 PRIME NUMBERS AND FACTORISATION 1.1 FACTORS: The natural numbers are the numbers 1,, 3, 4,. The integers are the naturals numbers together with 0 and the negative integers. That is the integers
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationPractice Problems for Homework #6. Normal distribution and Central Limit Theorem.
Practice Problems for Homework #6. Normal distribution and Central Limit Theorem. 1. Read Section 3.4.6 about the Normal distribution and Section 4.7 about the Central Limit Theorem. 2. Solve the practice
More informationLogic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour
Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationMath 330A Class Drills All content copyright October 2010 by Mark Barsamian
Math 330A Class Drills All content copyright October 2010 by Mark Barsamian When viewing the PDF version of this document, click on a title to go to the Class Drill. Drill for Section 1.3.1: Theorems about
More informationOur goal first will be to define a product measure on A 1 A 2.
1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ algebra A 1 A 2 with the unit element is the σ algebra generated by the
More information4.3. Addition and Multiplication Laws of Probability. Introduction. Prerequisites. Learning Outcomes. Learning Style
Addition and Multiplication Laws of Probability 4.3 Introduction When we require the probability of two events occurring simultaneously or the probability of one or the other or both of two events occurring
More informationPART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationPEN A Problems. a 2 +b 2 ab+1. 0 < a 2 +b 2 abc c, x 2 +y 2 +1 xy
Divisibility Theory 1 Show that if x,y,z are positive integers, then (xy + 1)(yz + 1)(zx + 1) is a perfect square if and only if xy +1, yz +1, zx+1 are all perfect squares. 2 Find infinitely many triples
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora
princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of
More informationRoots of Real Numbers
Roots of Real Numbers Math 97 Supplement LEARNING OBJECTIVES. Calculate the exact and approximate value of the square root of a real number.. Calculate the exact and approximate value of the cube root
More informationN N mod (m + A M) (N mod 10) (1) N = N M (m 10 A) (N mod 10) 10. where. 1 m M 10 A is any integer (positive, negative, or 0), and, for M > 0,
Abstract. Simple divisibility rules are given for the 1 st 1000 prime numbers. PACS numbers: 02.10.Lh SIMPLE DIVISIBILITY RULES FOR THE 1 st 1000 PRIME NUMBERS C. C. Briggs Center for Academic Computing,
More informationLecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
More informationCHAPTER 2 FOURIER SERIES
CHAPTER 2 FOURIER SERIES PERIODIC FUNCTIONS A function is said to have a period T if for all x,, where T is a positive constant. The least value of T>0 is called the period of. EXAMPLES We know that =
More informationSolutions to Exercises 8
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.
More informationPERMUTATIONS AND COMBINATIONS HOW TO AVOID THEM AT ALL COSTS AND STILL ACTUALLY UNDERSTAND AND DO COUNTING PROBLEMS WITH EASE!
PERMUTATIONS AND COMBINATIONS HOW TO AVOID THEM AT ALL COSTS AND STILL ACTUALLY UNDERSTAND AND DO COUNTING PROBLEMS WITH EASE! A BRIEF FOURSTEP PROGRAM James Tanton www.jamestanton.com COMMENT: If I were
More informationChapter 1 A Pri Characterization of T m e Pairs w in Proceedings NCUR V. (1991), Vol. I, pp. 362{366. Jerey F. Gold Department of Mathematics, Department of Physics University of Utah DonH.Tucker Department
More informationMA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins
MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationCh. 13.2: Mathematical Expectation
Ch. 13.2: Mathematical Expectation Random Variables Very often, we are interested in sample spaces in which the outcomes are distinct real numbers. For example, in the experiment of rolling two dice, we
More informationSolution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.
[Chap. ] Pythagorean Triples 6 (b) The table suggests that in every primitive Pythagorean triple, exactly one of a, b,orc is a multiple of 5. To verify this, we use the Pythagorean Triples Theorem to write
More information16. Let S denote the set of positive integers 18. Thus S = {1, 2,..., 18}. How many subsets of S have sum greater than 85? (You may use symbols such
æ. Simplify 2 + 3 + 4. 2. A quart of liquid contains 0% alcohol, and another 3quart bottle full of liquid contains 30% alcohol. They are mixed together. What is the percentage of alcohol in the mixture?
More informationMIXDECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia
GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIXDECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia
More informationComparing Two Populations OPRE 6301
Comparing Two Populations OPRE 6301 Introduction... In many applications, we are interested in hypotheses concerning differences between the means of two populations. For example, we may wish to decide
More informationTwoSided Matching Theory
TwoSided Matching Theory M. Utku Ünver Boston College Introduction to the Theory of TwoSided Matching To see which results are robust, we will look at some increasingly general models. Even before we
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More information54 Prime and Composite Numbers
54 Prime and Composite Numbers Prime and Composite Numbers Prime Factorization Number of Divisorss Determining if a Number is Prime More About Primes Prime and Composite Numbers Students should recognizee
More informationChapter 3 Joint Distributions
Chapter 3 Joint Distributions 3.6 Functions of Jointly Distributed Random Variables Discrete Random Variables: Let f(x, y) denote the joint pdf of random variables X and Y with A denoting the twodimensional
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationCombinatorics with Repetitions and Conditions
Combinatorics with Repetitions and Conditions Note: The questions with Hints written in red have not yet been discussed in class. These hints are a new addition to the original handout. Theorem. (Permutations
More informationAxiom A.1. Lines, planes and space are sets of points. Space contains all points.
73 Appendix A.1 Basic Notions We take the terms point, line, plane, and space as undefined. We also use the concept of a set and a subset, belongs to or is an element of a set. In a formal axiomatic approach
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationDefine the set of rational numbers to be the set of equivalence classes under #.
Rational Numbers There are four standard arithmetic operations: addition, subtraction, multiplication, and division. Just as we took differences of natural numbers to represent integers, here the essence
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 ChurchTuring thesis Let s recap how it all started. In 1990, Hilbert stated a
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationAlgebra for Digital Communication
EPFL  Section de Mathématiques Algebra for Digital Communication Fall semester 2008 Solutions for exercise sheet 1 Exercise 1. i) We will do a proof by contradiction. Suppose 2 a 2 but 2 a. We will obtain
More informationBasics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850
Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationMarkov random fields and Gibbs measures
Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).
More informationGenerating Functions Count
2 Generating Functions Count 2.1 Counting from Polynomials to Power Series Consider the outcomes when a pair of dice are thrown and our interest is the sum of the numbers showing. One way to model the
More information5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1
MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing
More informationWe give a basic overview of the mathematical background required for this course.
1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationMathematical Induction. Lecture 1011
Mathematical Induction Lecture 1011 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 2 Logic: Predicate Calculus 1 Outline Predicates Quantifiers Binding Applications Logical Equivalences 2 Predicates In mathematics arguments, we will often see sentences
More informationMarch 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More information