Mathematical Foundations of Computer Science Lecture Outline

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Mathematical Foundations of Computer Science Lecture Outline September 21, 2016 Example. How many 8-letter strings can be constructed by using the 26 letters of the alphabet if each string contains 3,4, or 5 vowels? There is no restriction on the number of occurrences of a letter in the string. Solution. Let E be the set of 8-letter strings that contain at least 3 vowels. Let E i be the set of 8-letter strings containing exactly i vowels. An element of E i, i.e., a 8-letter string with exactly i vowels, can be constructed using the following steps. Step 1. Choose i locations out of the available 8 locations for vowels. Step 2. Choose the vowels for each of the i locations. Step 3. Choose the consonants for each of the remaining 8 i locations. Step 1 can be performed in ( 8 i ways. Step 2 can be performed in 5 i ways. Step 3 can be performed in 21 8 i

2 ways. By the multiplication rule, the number of 8-letter strings with exactly i vowels is given by ( 8 E i = 5 i 21 8 i i Since the sets E 3, E 4, and E 5 partition the set E, by the addition rule we get E = 5 E i = i=3 5 i=3 ( 8 5 i 21 8 i i The following question was raised in class. What if we want to count all 8-letter strings with distinct letters that have 3, 4, or 5 vowels? In this case, the above procedure still applies. However, the number of ways of doing each step changes. Step 1 can be performed in ( 8 i ways. Step 2 can be performed in P (5, i ways. Step 3 can be performed in P (21, 8 i ways. By the multiplication rule, the number of 8-letter strings with distinct letters that have exactly i vowels is given by ( 8 P (5, ip (21, 8 i i The total number of 8-letter strings with distinct letters that have 3, 4, or 5 vowels is 5 i=3 ( 8 P (5, ip (21, 8 i i

3 Permutations of Multisets. Let S be a multiset that consists of n objects of which n 1 are of type 1 and indistinguishable from each other. n 2 are of type 2 and indistinguishable from each other.. n k are of type k and indistinguishable from each other. and suppose n 1 + n n k = n. What is the number of distinct permutations of the n objects in S? A permutation of S can be constructed by the following k-step process: Step 1. Choose n 1 places out of n places for type 1 objects. Step 2. Choose n 2 places out of the remaining n n 1 places for type 2 objects Step k. Choose n k places of the remaining unused places for type k objects. By the multiplication rule, the total number of permutations of n objects in S is

4 = = ( ( ( n n n1 n n1 n 2 n k 1 n 1 n 2 n! n 1!(n n 1! (n n 1! n 2!(n n 1 n 2! n n 1 n 2 n k 1 n k!(n n 1 n k! n! n 1!n 2! n k! n k Example. How many permutations are there of the word MISSISSIPPI? Solution. We want to find the number of permutations of the multiset {1 M, 4 I, 4 S, 2 P }. Thus, n = 11, n 1 = 1, n 2 = 4, n 3 = 4, n 4 = 2. Then number of permutations is given by n! n 1!n 2!n 3!n 4! = 11! 1!4!4!2! Example. Consider n distinct objects and k bins labeled B 1, B 2,..., B k. How many ways are there to distribute the objects in the bins so that bin B i receives n i objects and k i=1 n i = n? Solution. A partition of n objects into k labeled bins, B 1, B 2,..., B k such that bin B i gets n i objects can be constructed in k steps. Step i, 1 i k chooses n i objects that go in box B i from the remaining objects. Step i, 1 i k can be performed in ( n n 1 n 2 n i 1 n i ways. By the multiplication rule, the total number of ways to achieve the required partition equals

5 = ( ( ( ( n n n1 n n1 n 2 n n1 n 2 n k 1 n 1 n 2 n! n 1!n 2! n k! n 3 Another way of arriving at the solution is as follows. Let the distinct objects be numbered 1, 2,..., n. Consider the multiset A = {n 1 B 1, n 2 B 2,..., n k B k }. The procedure of obtaining the required partition can be done in k + 1 steps as follows. In Step 0, we obtain a permutation P of the multiset A. In step i, 1 i k, bin B i gets the objects corresponding to the positions of B i in P. n! Step 1 can be done in n 1!n 2! n k! ways. There is exactly one way to do each of the remaining steps. Hence, by the multiplication rule, the required answer is n! n 1!n 2! n k! Example. In how many ways can eight distinct books be divided among three students if Bill gets four books and Sharon and Marian each get two books? n k Solution. Such partition can be obtained in three steps. Step 1. Choose 4 books for Bill out of the available 8 books. Step 2. Choose 2 books for Sharon out of the remaining 4 books.

6 Step 3. Choose 2 books for Marian out of the remaining 2 books. Step 1 can be performed in ( 8 4 ways. Step 2 can be performed in ( ( 4 2 ways. Step 3 can be performed in 2 2 = 1 way. By the multiplication rule, the total number of possible divisions is given by ( ( 8 4 = 8! 4 2 4!4! 4! 2!2! = 420. r-combinations with Repetition Allowed. We have seen that there are ( n r ways of choosing r distinct elements from a set of n distinct elements. What if we allow elements to be repeated? In other words, we want to find the number of ways there are to choose a multiset of r elements from a multiset of n distinct elements with infinite copies of each of the n elements available? The following method was suggested in class. A multiset of r elements can be constructed in r steps as follows. In Step i, choose one of the n elements. Since each step can be done in n ways, there are n r multisets of r elements. Is this correct? No, this is not correct. For example, let S = {a, b}. Suppose we want to find the number of 2-combinations of S with repetition allowed.

7 Note that the above procedure would consider the sets {a, b} and {b, a} as different whereas they are the same multiset and should not be counted twice. Using the above solution we get the answer as 4, but the correct answer is 3. In other words, the above procedure gives incorrect answer as it pays attention to the order of the r elements. We give the correct solution below. Think of the n elements of the set as categories formed using n 1 vertical bars (sticks. Then each multiset of size r can be represented as a string of n 1 vertical bars (to separate the n categories and r crosses (to represent the r elements to be chosen. The number of crosses in each category represents the number of times the object represented by that category is chosen. Note that each multiset of size r (chosen from a multiset of n objects, with infinite copies of each object, corresponds to exactly one way to arrange the n 1 sticks and r crosses and for each arrangement of n 1 sticks and r crosses, there is exactly one multiset of size r. Thus the number of multisets of size r is the same as the number of permutations of the multiset {(n 1, r }. The number of strings of n 1 vertical bars and r crosses is the number of ways to choose r positions from the available r + n 1 positions. The r positions chosen will contain the crosses and the remaining positions will have the vertical bars. Thus the total number of possible ways to choose multisets of size r from a multiset of n objects with infinite

8 copies of each object available is given by ( n + r 1 (n + r 1! = r (n 1!r! Example. Consider 3 books: a computer science book, a math book, and a history book. Suppose the library has at least 6 copies of each of these books. How many ways are there to select 6 books? Solution. The no of ways is ( = 8! 6!2! = 28. Example. How many solutions are there to the equation x 1 + x 2 + x 3 + x 4 = 10 if x 1, x 2, x 3, and x 4 are non-negative integers? What if each x i 1? Solution. Think of x 1, x 2, x 3, and x 4 as categories in which we must place 10 s. The number of s in each category represents the value of the corresponding variable in the equation. The number of solutions is the number of 10 multisets of a 4-element set. This is given by ( ( = = If each x i 1, we put one in each category to start with. Then we distribute the remaining 6 s among the categories. Such a distribution can be represented by a

9 string of 3 vertical bars and 6 crosses. The number of such distributions are ( ( = = Example. What is the number of non-decreasing sequences of length 10 whose terms are taken from 1 through 25? Solution. The procedure of constructing a non-decreasing sequence of length 10 using integers from 1 through 25 is as follows: in step 1, choose 10 numbers with repetition allowed, from { 1, 2,..., 25}, and in step 2, order the chosen numbers in non-decreasing order. Note that the number of ways to do Step 1 is the same as the number of permutations of the multiset {24, 10 }, since we can think of the 25 digits as 25 categories (created using 24 in which 10 s are to be placed. There is exactly one way to do step 2. Thus, the total number of ways that this can be done is given by ( Example. How many solutions are there to the equation x 1 + x 2 + x 3 + x 4 = 10 if x 1, x 2, x 3, and x 4 are non-negative integers? What if each x i 1? Solution. Think of x 1, x 2, x 3, and x 4 as categories in which we must place 10 s. The number of s in each

10 category represents the value of the corresponding variable in the equation. The number of solutions is the number of 10 multisets of a 4-element set. This is given by ( ( = = 286. If each x i 1, we put one in each category to start with. Then we distribute the remaining 6 s among the categories. Such a distribution can be represented by a string of 3 vertical bars and 6 crosses. The number of such distributions are ( ( = 9 6 = 84 Example. How many ways are there to choose a 5- letter strings from the 26-letter English alphabet with replacement, where strings that are anagrams are considered the same? Solution. Let S be the set of all 5-letter strings such that if a string is in S then its anagrams are not in S. We are interested in finding S. Note that two words are anagrams of each other iff the number of occurrences of each letter in the alphabet is the same same in both words. Thus the S is the same as the number of 5- combinations with repetitions allowed from a multiset { a, b, c,..., z}. Thus S = ( ( = Example. There are 15 customers and 4 cashiers. How many ways can the customers line up to the cashiers, if the order of each line does not matter.

11 Solution. This problem can be solved using the sticks and crosses method in which n = 4 and r = 15. Thus the answer is ( ( = 18 3 Combinatorial Proofs Example. ( n 0 Solution. ( n + 0 ( n 2 Prove that ( n + 1 ( n ( 1 n ( n n We want to prove that ( ( n n = ( n + 3 = 0 ( n Consider a set X = {x 1, x 2, x 3,..., x n }. We want to show that the total number of subsets of X that have even size equals the total number of subsets of X that have odd size. We will now show that both these quantities equal 2 n 1 from which the claim follows. An even-sized subset of X can be constructed as follows. Step 1. Decide whether x 1 belongs to the subset of not. Step 2. Decide whether x 2 belongs to the subset of not.. Step n. Decide whether x n belongs to the subset of not.

12 Note that there are 2 choices for each of the first n 1 steps but exactly one choice for performing step n. This is because if we have choose an even number of elements from X \ {x n } then we must leave out x n otherwise we must include x n in the subset. Hence using the multiplication rule the total number of even-sized subsets of X equals 2 n 1. Since we know that the total number of subsets of X is 2 n, the total number of odd-sized subsets of X is 2 n 2 n 1 = 2 n 1.

Spring 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

COUNTING SUBSETS OF A SET: COMBINATIONS

COUNTING SUBSETS OF A SET: COMBINATIONS DEFINITION 1: Let n, r be nonnegative integers with r n. An r-combination of a set of n elements is a subset of r of the n elements. EXAMPLE 1: Let S {a, b, c, d}.

The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

Basics 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

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,

CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

Discrete mathematics

Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/01, Winter term 2015/2016 About this file This file is meant to be a guideline for the lecturer. Many

Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

1(a). How many ways are there to rearrange the letters in the word COMPUTER?

CS 280 Solution Guide Homework 5 by Tze Kiat Tan 1(a). How many ways are there to rearrange the letters in the word COMPUTER? There are 8 distinct letters in the word COMPUTER. Therefore, the number of

Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way

Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 7, due Wedneday, March 14 Happy Pi Day! (If any errors are spotted, please email them to morrison at math dot berkeley dot edu..5.10 A croissant

Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

GROUPS 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

2.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

Homework 2 Solutions

CSE 21 - Winter 2012 Homework #2 Homework 2 Solutions 2.1 In this homework, we will consider ordinary decks of playing cards which have 52 cards, with 13 of each of the four suits (Hearts, Spades, Diamonds

Lecture 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.

Section Summary. The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams

Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and Combinations Generating Permutations

Sets 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

2.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

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

Week 3-4: Permutations and Combinations

Week 3-4: Pemutations and Combinations Febuay 24, 2016 1 Two Counting Pinciples Addition Pinciple Let S 1, S 2,, S m be disjoint subsets of a finite set S If S S 1 S 2 S m, then S S 1 + S 2 + + S m Multiplication

Announcements. CompSci 230 Discrete Math for Computer Science Sets. Introduction to Sets. Sets

CompSci 230 Discrete Math for Computer Science Sets September 12, 2013 Prof. Rodger Slides modified from Rosen 1 nnouncements Read for next time Chap. 2.3-2.6 Homework 2 due Tuesday Recitation 3 on Friday

SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

8.3 Probability Applications of Counting Principles

8. Probability Applications of Counting Principles In this section, we will see how we can apply the counting principles from the previous two sections in solving probability problems. Many of the probability

Sets and Counting. Let A and B be two sets. It is easy to see (from the diagram above) that A B = A + B A B

Sets and Counting Let us remind that the integer part of a number is the greatest integer that is less or equal to. It is denoted by []. Eample [3.1] = 3, [.76] = but [ 3.1] = 4 and [.76] = 6 A B Let A

Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the

Math 475, Problem Set #13: Answers. A. A baton is divided into five cylindrical bands of equal length, as shown (crudely) below.

Math 475, Problem Set #13: Answers A. A baton is divided into five cylindrical bands of equal length, as shown (crudely) below. () ) ) ) ) ) In how many different ways can the five bands be colored if

If n is odd, then 3n + 7 is even.

Proof: Proof: We suppose... that 3n + 7 is even. that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. that 3n + 7 is even. Since n is odd, there exists an integer k so that

Examination paper for MA0301 Elementær diskret matematikk

Department of Mathematical Sciences Examination paper for MA0301 Elementær diskret matematikk Academic contact during examination: Iris Marjan Smit a, Sverre Olaf Smalø b Phone: a 9285 0781, b 7359 1750

3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

Online Materials: Counting Rules The Poisson Distribution

Chapter 6 The Poisson Distribution Counting Rules When the outcomes of a chance experiment are equally likely, one way to determine the probability of some event E is to calculate number of outcomes for

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

Just 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

Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

I. 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

SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can

Chapter 4 Lecture Notes

Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,

GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

Functions CHAPTER 2. Introduction. 2.1 Some Basic Terminology. Terminology for Sets

CHAPTER 2 Functions Introduction Functions play a fundamental role in nearly all of mathematics Combinatorics is no exception In the next section we review the basic terminology and notation for functions

Formal 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

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b

In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should

POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

Lecture 18: Applications of Dynamic Programming Steven Skiena. Department of Computer Science State University of New York Stony Brook, NY 11794 4400

Lecture 18: Applications of Dynamic Programming Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Problem of the Day

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

MATHEMATICS. Y5 Multiplication and Division 5330 Square numbers, prime numbers, factors and multiples. Equipment. MathSphere

MATHEMATICS Y5 Multiplication and Division 5330 Square numbers, prime numbers, factors and multiples Paper, pencil, ruler. Equipment MathSphere 5330 Square numbers, prime numbers, factors and multiples

Theory of Computation

Theory of Computation For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Theory of Computation Regular Expressions and Finite Automata, Context-Free Grammar s

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

7 Relations and Functions

7 Relations and Functions In this section, we introduce the concept of relations and functions. Relations A relation R from a set A to a set B is a set of ordered pairs (a, b), where a is a member of A,

arxiv:math/0606467v2 [math.co] 5 Jul 2006

A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group arxiv:math/0606467v [math.co] 5 Jul 006 Richard P. Stanley Department of Mathematics, Massachusetts

13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

The four [10,5,4] binary codes

1 Preliminaries The four [10,,] binary codes There are four distinct [10; ; ] binary codes. We shall prove this in a moderately elementary way, using the MacWilliams identities as the main tool. (For the

APPLICATIONS AND MODELING WITH QUADRATIC EQUATIONS

APPLICATIONS AND MODELING WITH QUADRATIC EQUATIONS Now that we are starting to feel comfortable with the factoring process, the question becomes what do we use factoring to do? There are a variety of classic

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 13. Random Variables: Distribution and Expectation

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 3 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected

A Hajós type result on factoring finite abelian groups by subsets II

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

Set Theory Basic Concepts and Definitions

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

arxiv:math/0202219v1 [math.co] 21 Feb 2002

RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France

MA3059 Combinatorics and Graph Theory

MA3059 Combinatorics and Graph Theory Martin Stynes Department of Mathematics, UCC January 23, 2007 Abstract These notes are designed to accompany the textbook A first course in discrete mathematics by

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

REPEATED TRIALS. The probability of winning those k chosen times and losing the other times is then p k q n k.

REPEATED TRIALS Suppose you toss a fair coin one time. Let E be the event that the coin lands heads. We know from basic counting that p(e) = 1 since n(e) = 1 and 2 n(s) = 2. Now suppose we play a game

1 Approximating Set Cover

CS 05: Algorithms (Grad) Feb 2-24, 2005 Approximating Set Cover. Definition An Instance (X, F ) of the set-covering problem consists of a finite set X and a family F of subset of X, such that every elemennt

not to be republishe NCERT SETS Chapter Introduction 1.2 Sets and their Representations

SETS Chapter 1 In these days of conflict between ancient and modern studies; there must surely be something to be said for a study which did not begin with Pythagoras and will not end with Einstein; but

Pure Math 30: Explained!

www.puremath30.com 323 Lesson 1, Part One: The Fundamental Counting Principle The Fundamental Counting Principle: This is an easy way to determine how many ways you can arrange items. The following examples

1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

A Study on the Necessary Conditions for Odd Perfect Numbers

A Study on the Necessary Conditions for Odd Perfect Numbers Ben Stevens U63750064 Abstract A collection of all of the known necessary conditions for an odd perfect number to exist, along with brief descriptions

College of information technology Department of software

University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************

VIDEO SCRIPT: 8.2.1 Data Management

VIDEO SCRIPT: 8.2.1 Data Management OUTLINE/ INTENT: Create and control a simple numeric list. Use numeric relationships to describe simple geometry. Control lists using node lacing settings. This video

NUMBER SYSTEMS. William Stallings

NUMBER SYSTEMS William Stallings The Decimal System... The Binary System...3 Converting between Binary and Decimal...3 Integers...4 Fractions...5 Hexadecimal Notation...6 This document available at WilliamStallings.com/StudentSupport.html

Computability Theory

CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.

CS 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 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a

Part A: Fill in the blanks below with whole numbers greater than 1 that will make the number sentences true.

New York State Testing Program Mathematics Common Core Sample Questions Grade3 The materials contained herein are intended for use by New York State teachers. Permission is hereby granted to teachers and

3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

MA40S APPLIED AND PRE-CALC PERMUTATIONS AND COMBINATIONS SUMMARY AND WORD PROBLEMS

1 MA40S APPLIED AND PRE-CALC PERMUTATIONS AND COMBINATIONS SUMMARY AND WORD PROBLEMS FUNDAMENTAL COUNTING PRINCIPLE. If one thing can be done in m different ways and, when it is done in any one of these

Worksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation

Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other

Elements of probability theory

2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted

Ch. 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

PRIMES 2017 Math Problem Set

Dear PRIMES applicant: PRIMES 2017 Math Problem Set This is the PRIMES 2017 Math Problem Set. Please send us your solutions as part of your PRIMES application by the application deadline (December 1, 2016).

Exponentials. 1. Motivating Example

1 Exponentials 1. Motivating Example Suppose the population of monkeys on an island increases by 6% annually. Beginning with 455 animals in 2008, estimate the population for 2011 and for 2025. Each year