# (Refer Slide Time: 01.26)

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 27 Pigeonhole Principle In the next few lectures we shall consider some topics in combinatorics. The first one we shall consider is the Pigeonhole Principle. It is a very simple concept and we shall consider the concept and then some problems under the principle. (Refer Slide Time: 01.26) The simple form of the Pigeonhole Principle is like this: If n plus 1 objects are put into n boxes, then at least one box contains two or more of the objects. It is a very simple thing, very easily understandable and so on. In fact something like this is said if n plus pigeons are put into n pigeon holes at least one pigeon hole will contain two or more pigeons. That is why this concept is called Pigeonhole Principle. It is a very simple idea. Let us see how this idea can be used to solve some problems.

2 (Refer Slide Time: 02.09) Some applications are as follows: Among 1three people there are 2 who have their birthdays in the same month because there are only 12 months there are 1three people 2 of them will have their birthday in the same month, in a very simple concept. The next one is, given m integers a 1, a 2, am there exist k and l where k and l are between 1 and m such that a k plus 1 plus a k plus 2 plus a l is divisible by m. That is if you take the successive numbers and sum that will be divisible by m. If you put it less formally there exist consecutive a s in the sequence a 1, a 2, am whose sum is divisible by m. (Refer Slide Time: 03.14) How do you use Pigeonhole Principle to prove this?

3 To see this consider the m sums a 1, a 1 plus a 2, a 1 plus a 2 plus a 3. Consider a 1, a 1 plus a 2, a 1 plus a 2 plus a 3 and so on. There are m such sums. If any of these sums is divisible by m then obviously the conclusion holds. The result follows: so thus we may assume that each of these sums has a non zero remainder when divided by m. That is, none of these sums are divisible by m. So when divided by m they will leave some remainder and that is non zero so it will be from 1 to m minus 1 one of the integers from 1 to m minus 1. The remainder will be equal to one of the integers 1, 2, 3 up to m minus 1. (Refer Slide Time: 04.19) Now, we have m sums and only m minus 1 remainder m minus 1 possible values for the remainders two of the sums will have the same remainder when divided by m. Therefore there are two integers k and l and let us assume that l is greater than k such that a 1 plus a 2 plus a k leaves the remainder r when divided by m. And a 1 plus a 2 plus a 3 up to a l also leaves the same remainder r when divided by m. That means a 1 plus a 2 plus a k is equal to sum b cross m plus r where b is an integer. And a 1 plus a 2 is equal to a 3 up to al is cm plus r where c is an integer. Now l is greater than k so subtract this from this you will find that a k plus 1 up to a l that is the remaining elements from here after a k that is equal to c minus b cross m that is where c is an integer and b is an integer so c minus b is an integer and this sum a k plus 1 up to a l is divisible by m. Thus we prove that a k plus 1 a k plus 2 up to a l is divisible by m, this is another simple application. There are strong forms of the Pigeonhole Principle let us consider them.

4 (Refer Slide Time: 06.03) The same idea but extended in a slightly different way. Let q 1, q 2, q n be positive integers. If q 1 plus q 2 plus q 3 plus q n minus n plus one objects are put into n boxes, then either the first box contains at least q 1 objects or the second box contains at least q 2 objects and so on or the nth box contains at least q n objects. This is again very simple. Let us see, there are n boxes n and there are q 1 plus q 2 plus q n minus n plus 1 objects. Suppose the first box contains less than q 1 objects maximum it can have is q minus 1. And if it contains less than q 2 objects the maximum it can contain is q 2 minus 1. And proceeding like that the maximum number this can have is q n minus 1 if the nth box contains less than q n minus 1 elements. So the total number of elements you can have in all the boxes will be q 1 plus q 2 plus q n minus n in this case. So if you have q 1 plus q 2 plus q n minus n plus 1 objects at least one of the boxes will contain more than the supposed element. That is, either the first box will contain q 1 objects or more or second box will contain q 2 objects or more or the third box will contain q 3 or more objects or the nth box will contain q n or more objects.

5 (Refer Slide Time: 08.16) Putting it in another way: suppose q 1 is equal to q 2 is equal to q 3 etc. Suppose n cross r minus 1 plus 1 objects are put into n boxes then at least one of the boxes contains r or more objects. If each box contains less than r object the maximum it can contain is r minus 1 so totally in n boxes you can have only n cross r minus 1 objects. But now there is n cross r minus 1 plus 1 objects. So at least one of the boxes will contain r or more objects. Putting it in another way, this is another form of the statement. The n integers m 1, m 2, m n have an average m 1 plus m 2 plus m n by n because you have n integers the average is given by this number. And if the average is greater than r minus 1 then at least one of the integers m 1 plus m 2, m n is greater than or equal to r because otherwise the average will not be greater than r minus 1. So these are the different ways of putting the Pigeonhole Principle, depending upon the application we take the proper form. The idea is very simple but when we use it to solve problems we have to think and apply it in a proper manner. Let us consider some problems.

6 (Refer Slide Time: 09.57) A man hiked for 10 hours and covered a total distance of 45 miles. It is known that he hiked 6 miles in the first hour and only 3 miles in the last hour. Show that he must have hiked at least 9 miles within a certain period of two consecutive hours. This is the problem. A man hiked for 10 hours. So let a 1, a 2, a 10 be the number of miles he hiked in the ith hour. So a i is the number of miles he hiked in the ith hour. Of course i will vary from 1 to 10. Now, we know that a 1 is 6 and a 10 is 3. And it is said that we have to prove that consecutive two hours he would have hiked at least 9 miles. Suppose he has not hiked 9 miles or more in any two consecutive hours then what does that mean a 1 plus a 2 is less than 9, a 2 plus a 3 is less than 9 and so on, a 9 plus a 9 plus a 10 is less than 9. Therefore, adding you will get a 1 plus two times a 2 up to a 9 plus a 10 is less than 9 times 9 so 81. Add one more a 1 and a 10 but we know that a 1 and a 10 are 6 and 3 respectively. So that is equivalent to adding 9, you get that two times sigma a i is less than 90 or sigma a i is less than 45 which would mean it is contradicting the factor that he has hiked 45 miles in 10 hours. But we know that the man hiked for 10 hours and covered a total distance of 45 miles. So, if you assume that he has not hiked 9 miles or more in any two consecutive hours we come to the conclusion that the total distance covered by him is less than 45 which is not true. So, we are arriving at a contradiction and that would mean that he has hiked 9 miles or more at least in some consecutive hour.

7 (Refer Slide Time: 13.44) Let us take some more examples. (Refer Slide Time: 13.49) The circumference of a roulette wheel is divided into 36 sectors to which the numbers 1, 2, to 36 are assigned in some arbitrary manner. Show that there are three consecutive sectors such that the sum of their assigned numbers is at least 56. Again this problem is very similar to this one. You have a circumference circle which is divided into 36 possible sectors a 1 a 2 a 3 and so on, a 36 and each of them is assigned a number between 1

8 to 36 and the problem says that we have show that at least in one place three consecutive sectors the sum will add up to 56 or more. Suppose not in the same idea if a 1 a 2 a 3 are assigned, suppose the conclusion is not true then you have a 1 plus a 2 plus a 3 is less than or equal to 55, if it is not 56 or more it has to be less than or equal to 55. Similarly, a 2 plus a 3 plus a 4 is less than or equal to 55 and proceeding like that a 35 plus a 36 plus a 1 is less than or equal to 55 and a 36 plus a 1 plus a 2 is less than or equal to 55. Now add up this you will get a 1 is occurring in three places a 2 is occurring in three places so the sum will be three times sigma a i that will be less than or equal to 55 cross 36 there are 36 inequalities adding the right hand side of the inequalities you get this. But what is sigma i? Each a i is between 1 and 36, the numbers between 1 and 36 are assigned to a 1 a 2 a 3. So this will be 3 cross sigma a i will be 36 cross 37 by 2 because the sum of the first ten integers is given by n cross n plus 1 by 2, here the sum of the first 36 integers is given by 36 cross 37 by 2 that is less than or equal to cross 37 by 2, 36 canceling 36 on both sides you will get 3 cross 37 is 111 and 111 is less than or equal to taking the 2 on the other side you will get 110. So you get the result 111 is less than or equal to 110 which is not correct so you are arriving at a contradiction. So the result follows that is there are three consecutive sectors such that the sum of their assigned numbers is at least 56. (Refer Slide Time:.17.08) I can see the similarity between this problem and the previous problem and you can also see the application of the Pigeonhole Principle. The third one is like this; from the integers of them are chosen arbitrarily. Show that among the chosen numbers there exist two such that one divides another. So, the numbers are between 1 and 200 that is 1, 2, to 200 and you are selecting 101 of them. Show that there are at least two where

9 one will divide the other. Now this can be solved in this manner, you have 100 holes or 100 holes or boxes one for each for the odd numbers and so on. There are 100 boxes, take a number, if you pick a number i express i as some r cross 2 power k, each number you can express like this r cross 2power k where k will be greater than or equal to 0. For example, if I take 55 that is 55 cross 2 power 0, you can write like this. If I take 112 then 112 is how many times? It is 64 divided by 8, 7 cross 2 power 4, 16 cross 7 is 112 you can write like this. Now, whenever you have a number like this you write it as r cross 2 power k. So put this number in the box corresponding to r. So if I have selected 55 I will put 55 in the box corresponding to 55. If I had selected 112 I will put it in the box corresponding to 7. So when I select 101 numbers out of 200 numbers and put them in the boxes corresponding to these like this by the Pigeonhole Principle one box will contain at least two elements. Suppose a particular box x contains two elements then there are two numbers m is equal to x cross 2 power p this box corresponding to x x is an odd number it contains two elements m and n. Then m can be represented as x cross 2 power p and n will be represented as x cross 2 power q. Now obviously p will be less than q or one of them will be less than the other p and q cannot be equal because m and n are different. Suppose m is greater than n then p will be greater than q and m is divided by n and m by n will be is equal to 2 power p minus q. So m is divided by n. There are two numbers such that one divides the other so we proved the result. So you can see how the Pigeonhole Principle is applied here. (Refer Slide Time: 21.28)

10 (Refer Slide Time: 21.38) The next is, it is a continuation of this, select 100 integers from the integers 1, 2, to 200 such that no one of them is divisible by any other. So from 1 to 200 you are asked to select 100 of them so that no two of them are such that one divides the other. If you select 101, 102 to 200 you will realize that none of them divides the other. You can see like this, argue out like this, even if you take the least element and multiply by the smallest integer it will be 202 which exceeds this. So this will not divide any of this and similarly any one of them will not divide the other that is one argument. and when we consider the earlier thing try to express each one of them as x cross 2 power some k and try to put in each one in one of the pigeon holes etc these 100 pigeonholes you will realize that these 100 numbers will be put in 100 different boxes each one will contain only one of them. You can try that and check whether it is correct, no two of them will be put in the same box. So you can take it as an exercise and try to put these numbers into those 100 boxes. The next problem is also somewhat a similar one. Show that given any 52 integers there exist two of them whose sum or else whose difference is divisible by 100. The numbers can range in any way. So let a 1 a 2 a 52 be the integers, they are some integers. And you are asked to show that there are two of them such that the sum will be divisible by 2 or the difference will be divisible by 2. You can always select two from these 52 integers such that the sum or the difference of will be divisible by 100, how do you prove that? Now any number a i you can express as 100 k plus b i you can express a number like this a i is equal to 100k plus b i. What is the range for b i? It will be from 0 to 99.

11 (Refer Slide Time: 25.03) Now, let us consider some boxes like this corresponding to boxes. You consider 51 boxes like this. Any number a i is of the form 100k plus b i. Now if b i is 0 you put it here, if bi is 50 you put it here, if bi is equal to 1 or 99 you put it here in the box corresponding to 1. So you put b i in the box j if b i is equal to j or 100 minus j. Now, how many boxes are there? There are 51 boxes there. And how many numbers are there? There are 52 numbers. So by the Pigeonhole Principle two of them will be put in the same box. So two numbers say a m and a n will be in the same box because of the Pigeonhole Principle. Suppose a m is equal to some 100 times k plus b m and an is 100 times l plus b n they are in the same box and let the box be the jth box. So b m is j or 100 minus j, b n is also j or 100 minus j.

12 (Refer Slide Time: 27.51) Suppose b m is the same as b n then am minus an will be hundred times k minus l so the difference is divisible by 100. Suppose b m is j and b n is 100 minus j then am plus an will be 100 cross k plus l plus b m plus b n will be 100 plus 100. So the sum am plus an will be divisible by 100 so any number a i you express as 100k plus b i where b i will be from 0 to 99 and you consider 51 boxes like this 0, 1, 2 corresponding to 50 and you put a number in a corresponding box j if b i is j or 100 minus j. For example, if b i is 1 you will put here, if b i is 99 also you will put here, if b i is 2 you will put here, if b i is 98 also you put it here, like that you put because there are 52 numbers and 51 boxes at least one of them will contain two numbers by the Pigeonhole Principle. And suppose a m and a n are in the same box j then you can write am in the form 100k plus b m and a n you can write as 100 plus b n where b m will be j or 100 minus j and b n also will be j or 100 minus j. If they are the same consider the difference the difference will be divisible by 100. If one is j and another is 100 minus j consider the sum of the two numbers the sum will be divisible by 100. So this way we can prove that given any 52 integers there exist two of them whose sum or else whose difference is divisible by 100. Take another problem. Let us go through the statement of the problem carefully.

13 (Refer Slide Time: 30.34) A student has 37 days to prepare for an examination. From past experience she knows that she will require no more than 60 hours of study. She also wishes to study at least 1 hour per day. Show that no matter how she schedules her study time a whole number of hours per day however, there is a succession of days during which she will have studied exactly 13 hours. A student has 37 days to prepare for an exam and she needs to prepare for 60 hours. A student has 37 days to prepare for an examination. From the past experience she knows that she will require no more than 60 hours of study. She also wishes to study at least 1 hour per day. Show that no matter how she schedules her study time, there is a succession of days during which she will have studied exactly 13 hours. Suppose on the first day she has studied for a 1. At the end of the second day she has studied for a 2 hours. At the end of the third day she has studied for a 3 hours. That is the first day she studies for a 1 hours. The first and second day put together she has studied for a 2 hours and the third day that is the first three days she has studied a 3 hours and so on. So on the 37th day she has studied for 60 hours. So this is an increasing sequence. So every day a i is the number of hours she has studied up to ith day. So this particular sequence is an increasing sequence because everyday she studies at least 1 hour. And these numbers are between 1 and 60 because maximum she studies only for 60 hours. And consider this sequence, now what we want to prove is some consecutive days she has exactly studied 13 hours. That is some a j minus a i is equal to 13 where j is greater than i this is what we want to prove.

14 (Refer Slide Time: 34.06) Now consider this sequence a 1 plus 13, a 2 plus 13 etc a 37 plus 13. a 1 a 2 a 3 a n is an increasing sequence so we are adding 13 to every number. So a 1 plus 13, a 2 plus 13, a 3 plus 13, a 37 plus 13 is also an increasing sequence and all numbers are all different. So this is an increasing sequence and the values will range from 13 to 73. A 37 is 60 so 60 plus 13 is equal to 73. The values will range between these two 13 and 73. Now consider the numbers a1 a2 a37 a1 plus 13 etc up to a37 plus 13, how many numbers are there here? It is 37 plus 37 is equal to 74 numbers are there. And the value is a i ranges from 1 to 60 the other sequence the numbers range from 13 to 73. So these numbers the value ranges between 1 and 73, these numbers are between 1 and 73. And there are 74 such numbers so two of them will be equal. Obviously by the Pigeonhole Principle two of them will be equal. Now you know that none of these numbers are equal because every day she studies at least 1 hour. These numbers are all different and these numbers are all again different because with each number you are adding 13. So the fact that two of these are equal would mean that sum a j will be equal to sum ai plus 13. Obviously, j has to be greater than i so a j minus a i will be 13. That is from the i plus 1th day till the jth day she has exactly studied for 13 hours. That is from the i plus 1th day to jth day she has studied for 13 hours. So, you can see how the Pigeonhole Principle is applied here.

15 (Refer Slide Time: 37:37) Let us take one more problem. (Refer Slide Time: 37.46) Suppose that in a group of 6 persons each pair are either friends or enemies. Prove that among 6 either there are 3 persons who are mutual friends each is a friend of the other or else there are 3 persons who are mutual enemies each is an enemy of the others. Also show that this is not true for 5 persons. So you can consider it like this. You are having 6 persons a b c d e f. If a and b are friends, I will put a line like this straight line. If a and b are enemies I will put a line like this. So if x and y are friends you consider like this,

16 friends, enemies if x and y are enemies, consider a and consider 3 of his friends. See, there are 5 people and either he will have three friends or three enemies. If a has three friends you can proceed in a following manner. either among the 5 the possibilities are, apart from a there are 5 people, the possibility is 5 friends and enemies, 5 friends no enemies, 4 friends 1 enemy, three friends 2 enemies, 2 friends three enemies, 1 friend 4 enemies, 0 friend all enemies. So either a will have three friends or he will have three enemies. This is by Pigeonhole Principle. Either a will have three friends or three enemies. (Refer Slide Time: 41.08) Suppose he has got three friends we will see how we can deal with the case when he has three enemies, it is similar. Suppose he has three friends say suppose b, c and e are his friends then consider b and c or c and e and b and e. Either b and c are friends then you have three mutual friends or if e and c are friends again you are having three mutual friends. If otherwise if b and e are friends again you are having three mutual friends. On the other hand, none of them are mutual friends suppose b and c are enemies, suppose c and e are also enemies and b and e are also enemies, then you are having three mutual enemies. So in this case you are having three mutual enemies. So either you are having three friends or three mutual enemies. The other way round supposing a has three enemies, 3 or more enemies, a has three enemies like this now consider again b and c if they are enemies you are having three mutual enemies, if c and e are enemies like this you are having three mutual enemies, if b and e are enemies then again you are having three mutual enemies. Otherwise if they are not enemies b and c will be friends, c and e will be friends and b and e will be friends so you are having three mutual friends. So this shows that either you have three mutual friends or three mutual enemies among 6 persons.

17 (Refer Slide Time: 43.01) Now, the same is not true for 5 persons a b c d e the reason is, apart from a you are having 5 persons then either three of them will be friends to a or three of them will be enemies. More than 3 will be friends or 3 or more will be enemies this is because you can put like this. Now, apart from a there are only four of them so 2 can be friends and 2 can be enemies. So the fact that a will have three friends or three enemies does not hold anymore. So suppose b is a friend to a and e is a friend to a and c is enemy to a and d is also an enemy to a, I can design in such a way that there are no three people who are friends or there are no 3people who are enemies. Now a and e are friends, a and b are friends, so suppose it is possible that b and e are enemies and a and d are enemies, a and c are enemies but c and d can be friends, it can happen like that. Let us draw the other arcs also. Now, in this case you have to draw this arc and arcs we have drawn 4 more arcs we have to draw. Suppose b and c are friends then d and c are friends, b and c are friends. It is possible that b and d are enemies, you can have like this. And e and b are enemies b and d are enemies so it is possible that d and e are friends. So in that case you do not have three enemies or three friends. And similarly you are having d and c as friends and d and e as friends. So it is possible that c and e are enemies. Now, if you take any three of these vertices you will find that no three of them are friends or no three of them are mutual enemies. So it is possible to draw a graph like this with two different types of arcs such that five of them are of one type and five of them are of another type and you have their condition that no three of them are mutual friends or no three of them are mutual enemies. It is possible to draw like this. The reason is, apart

18 from a there are 5 people of which you put friends and enemies in two boxes, friends and enemies, 5 people you try to put them one of them should contain 3 and 3 or more. a will have either three friends or either he will have three enemies. And in that case we argued that how you get three mutual friends or three mutual enemies. Now, apart from a if you have only 4 people that condition does not hold. If you have two boxes friends and enemies you can put 2 in each of them and then you can construct a graph like this which shows that you do not have three mutual friends or three mutual enemies so the Pigeonhole Principle is again used here. Let us consider one more problem again, similarly. The same idea, it is a very simple idea. (Refer Slide Time: 47.29)

19 (Refer Slide Time: 47.52) You have two concentric disk. The circumference of the tow concentric disks are divided into 200 sections each as shown in the figure, let us see the figure. (Refer Slide Time: 48.10) You have two concentric circles like this and the circumference is divided into 200 sectors like this. For the outer disk 100 of the sections are painted red and 100 of the sections are painted blue. For the inner disk the sections are painted red or blue in an arbitrary manner. Show that it is possible to align the two disks so that 100 or more of the sections on the inner disks have their colors matched with the corresponding sections on the outer disk. The figure is like this; now in one position you are having a disk like this.

20 Suppose 1 to 200 is there and similarly here also 1 to 200. In how many ways you can align them? First is, 1 and 1 can be aligned in a manner then you can rotate and 2 can be aligned with 1 then you can again rotate and 3 can come in alignment with 1 so that 2 will come with 200 and will come like this. I am rotating in the anticlockwise direction. So, you can rotate in such a way that you get the next alignment. The first alignment of course 1 and 1, I number them as 1 to 200 and 1 to 200 here, 1 and 1 will align 200 and 200 will align and so on. If I rotate through one sector then 2 will align with 1 and so on. So how many possible alignments can you have? You can have possibly 200 alignments and the problem is it is possible to align the two disks so that 100 or more of the sections of the inner disk have their colors matched with the corresponding sections on the outer disk. Now, in the outer disk 100 of them are colored blue and 100 are painted red and in that disk they are arbitrarily painted in red or blue. So take in one alignment. In one alignment suppose this particular disk is colored red out of the 200 possible alignments in 100 possible alignments it will match with the corresponding sector in the outer disk. So in the 200 alignments the first sector will match in 100 of the 200 alignments, second sector will also match in 100 of the alignments, third sector will also match in 100 of the alignments and so on. So totally the number of matches will be 200 cross 100 is equal to matches you count the matches. In one alignment you count the matches, in the second alignment you count, the matches in the third alignment you count the matches, like that in the 200 alignments you count the matches. The total number of matches will be The reason is, each sector in the inner circle is painted red or blue and the outer sector 100 of them are painted red and 100 of them are painted blue. So if you take this sector which is painted red in 100 of the alignments it will match. If you take the next sector it will be blue or red so in 100 of them it will be matching and so on. So, if you count the number of matches in all the alignments it will add up to And how many alignments are there? There are 200 alignments, so the average is 100.

21 (Refer Slide Time: 53.22) So the average is 100, so at least in one alignment 100 or more of the sectors will match the corresponding colors. (Refer Slide Time: 53.40) Here we are making use of this; If n integers m 1, m 2, m n have an average which is greater than r minus 1 then at least one of the integers m 1 plus m 1, m 2, m n is greater than or is equal to r. So there are 200 alignments. Let us call them as alignment 1, alignment 2 and so on, alignment 200. You call the number of matches as m 1, m 2 and m 200. The sum is sigma mi is So the average sigma m i by 200 is 100, so it is greater than 99. So here in this example m 1, m 2, m n represents the number of matches in each alignment and

22 the average is greater than r minus 1 that is 99 it is at least 100 so at least one of them should be odd, in the number of matches at least one of them m 1, m 2, m n, m 200 is 100 or more. So we are making use of this form of the Pigeonhole Principle here. So let us recall the Pigeonhole Principle and the different versions again and it can be used to solve problems like this. The idea is very simple but when you tackle each problem you have to think in a different manner for the solution. (Refer Slide Time: 55.16) (Refer Slide Time: 55.22)

23 The simple form is this: n plus 1 objects are put into n boxes then at least one box contains two or more of the objects. (Refer Slide Time: 55.31) The stronger forms are like this: Let q 1, q 2, q n be positive integers. Then if q 1 plus q 2 plus q n minus n plus 1 objects are put into n boxes, then either the first box contains at least q 1 or the second box contains at least q 2 and or the nth box contains at least q n objects. (Refer Slide Time: 55.51)

24 The other two forms are like this: If n cross r minus 1 plus 1 objects are put into n boxes then at least one of the boxes contains r or more of the objects. And another form is, if you take the average of n elements if it is greater than r minus 1 then at least one will be greater than or is equal to r.

### Pigeonhole 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

### If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question

### 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

### Math 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

### 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

### Answer: Quantity A is greater. Quantity A: 0.717 0.717717... Quantity B: 0.71 0.717171...

Test : First QR Section Question 1 Test, First QR Section In a decimal number, a bar over one or more consecutive digits... QA: 0.717 QB: 0.71 Arithmetic: Decimals 1. Consider the two quantities: Answer:

### 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

### Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

### How do you compare numbers? On a number line, larger numbers are to the right and smaller numbers are to the left.

The verbal answers to all of the following questions should be memorized before completion of pre-algebra. Answers that are not memorized will hinder your ability to succeed in algebra 1. Number Basics

### 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

### 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

### MEMORY WORK - MATH FACTS 1

MEMORY WORK - MATH FACTS ADDITION BOARD (aka Strip Board) Addition with Golden Bead materials Addition with Colored Beads To memorize Addition Tables Linear structure of addition Addition Board MATERIALS:

### Worksheet for Teaching Module Probability (Lesson 1)

Worksheet for Teaching Module Probability (Lesson 1) Topic: Basic Concepts and Definitions Equipment needed for each student 1 computer with internet connection Introduction In the regular lectures in

### OPTIONS TRADING AS A BUSINESS UPDATE: Using ODDS Online to Find A Straddle s Exit Point

This is an update to the Exit Strategy in Don Fishback s Options Trading As A Business course. We re going to use the same example as in the course. That is, the AMZN trade: Buy the AMZN July 22.50 straddle

### MA 1125 Lecture 14 - Expected Values. Friday, February 28, 2014. Objectives: Introduce expected values.

MA 5 Lecture 4 - Expected Values Friday, February 2, 24. Objectives: Introduce expected values.. Means, Variances, and Standard Deviations of Probability Distributions Two classes ago, we computed the

### A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

### International Indian School, Riyadh SA1 Worksheet 2015-2016 Class: VI Mathematics

International Indian School, Riyadh SA1 Worksheet 2015-2016 Class: VI Mathematics CH KNOWING OUR NUMBERS I Fill In the blanks 1. 1km = mm 2. 1 gram = milligrams 3. The roman numeral M stands for the number

### Associative Property The property that states that the way addends are grouped or factors are grouped does not change the sum or the product.

addend A number that is added to another in an addition problem. 2 + 3 = 5 The addends are 2 and 3. area The number of square units needed to cover a surface. area = 9 square units array An arrangement

### Elementary Statistics and Inference. Elementary Statistics and Inference. 16 The Law of Averages (cont.) 22S:025 or 7P:025.

Elementary Statistics and Inference 22S:025 or 7P:025 Lecture 20 1 Elementary Statistics and Inference 22S:025 or 7P:025 Chapter 16 (cont.) 2 D. Making a Box Model Key Questions regarding box What numbers

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Possible Stage Two Mathematics Test Topics

Possible Stage Two Mathematics Test Topics The Stage Two Mathematics Test questions are designed to be answerable by a good problem-solver with a strong mathematics background. It is based mainly on material

### What are the place values to the left of the decimal point and their associated powers of ten?

The verbal answers to all of the following questions should be memorized before completion of algebra. Answers that are not memorized will hinder your ability to succeed in geometry and algebra. (Everything

### s = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 50 51. 2

1. Use Euler s trick to find the sum 1 + 2 + 3 + 4 + + 49 + 50. s = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 Thus, 2s = 50 51. Therefore, s = 50 51. 2 2. Consider the sequence

### MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 36 Location Problems In this lecture, we continue the discussion

### 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

### VISUAL ALGEBRA FOR COLLEGE STUDENTS. Laurie J. Burton Western Oregon University

VISUAL ALGEBRA FOR COLLEGE STUDENTS Laurie J. Burton Western Oregon University VISUAL ALGEBRA FOR COLLEGE STUDENTS TABLE OF CONTENTS Welcome and Introduction 1 Chapter 1: INTEGERS AND INTEGER OPERATIONS

### Contents. Remember boxes and speech bubbles Important key points and tips. Special Features of Start Up Mathematics 3-5

Contents 1. Numbers Beyond 999 1 2. Roman Numerals 23 3. Addition 26 Assessment Sheet 1 37 4. Subtraction 38 5. Multiplication 50 6. Division 69 Assessment Sheet 2 84 Let s Review 1 85 7. Fractions 87

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

### (Refer Slide Time: 01:11-01:27)

Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 6 Digital systems (contd.); inverse systems, stability, FIR and IIR,

### Statistics 100A Homework 4 Solutions

Chapter 4 Statistics 00A Homework 4 Solutions Ryan Rosario 39. A ball is drawn from an urn containing 3 white and 3 black balls. After the ball is drawn, it is then replaced and another ball is drawn.

### 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

### NOTES: Justify your answers to all of the counting problems (give explanation or show work).

Name: Solutions Student Number: CISC 203 Discrete Mathematics for Computing Science Test 3, Fall 2010 Professor Mary McCollam This test is 50 minutes long and there are 40 marks. Please write in pen and

### 1. Staircase Sums. Here is an example of a kind of arrangement that we'll call a "staircase". It has 4 steps and the first step is of height 2.

Arithmetic Sequences and Series 1 You will need: Lab Gear and/or graph paper. One Step at a Time 1. Staircase Sums Here is an example of a kind of arrangement that we'll call a "staircase". It has 4 steps

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

### Mathematics Vocabulary List For Pre-Algebra

Mathematics Vocabulary List For Pre-Algebra 1. Absolute Value - the distance from a number to zero on a number line. It is always positive. l-6 l = 6 l -25 l = 25 l 6 l = 6 l 25 l = 25 2. Associative Property

### Coefficient of Potential and Capacitance

Coefficient of Potential and Capacitance Lecture 12: Electromagnetic Theory Professor D. K. Ghosh, Physics Department, I.I.T., Bombay We know that inside a conductor there is no electric field and that

### SQUARE-SQUARE ROOT AND CUBE-CUBE ROOT

UNIT 3 SQUAREQUARE AND CUBEUBE (A) Main Concepts and Results A natural number is called a perfect square if it is the square of some natural number. i.e., if m = n 2, then m is a perfect square where m

### Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Karagpur

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Karagpur Lecture No. #06 Cryptanalysis of Classical Ciphers (Refer

### 4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?

1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of

### AMS 5 CHANCE VARIABILITY

AMS 5 CHANCE VARIABILITY The Law of Averages When tossing a fair coin the chances of tails and heads are the same: 50% and 50%. So if the coin is tossed a large number of times, the number of heads and

### Warm up. Connect these nine dots with only four straight lines without lifting your pencil from the paper.

Warm up Connect these nine dots with only four straight lines without lifting your pencil from the paper. Sometimes we need to think outside the box! Warm up Solution Warm up Insert the Numbers 1 8 into

### Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

### Surface bundles over S 1, the Thurston norm, and the Whitehead link

Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. In

### [Refer Slide Time: 05:10]

Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture

### SAT Math Strategies Quiz

When you are stumped on an SAT or ACT math question, there are two very useful strategies that may help you to get the correct answer: 1) work with the answers; and 2) plug in real numbers. This review

### Gear Trains. Introduction:

Gear Trains Introduction: Sometimes, two or more gears are made to mesh with each other to transmit power from one shaft to another. Such a combination is called gear train or train of toothed wheels.

### Oral and Mental calculation

Oral and Mental calculation Read and write any integer and know what each digit represents. Read and write decimal notation for tenths and hundredths and know what each digit represents. Order and compare

### Structural Analysis - II Prof. P. Banerjee Department of Civil Engineering Indian Institute of Technology, Bombay. Lecture - 02

Structural Analysis - II Prof. P. Banerjee Department of Civil Engineering Indian Institute of Technology, Bombay Lecture - 02 Good morning. Today is the second lecture in the series of lectures on structural

### EXPONENTS. To the applicant: KEY WORDS AND CONVERTING WORDS TO EQUATIONS

To the applicant: The following information will help you review math that is included in the Paraprofessional written examination for the Conejo Valley Unified School District. The Education Code requires

### Year 9 set 1 Mathematics notes, to accompany the 9H book.

Part 1: Year 9 set 1 Mathematics notes, to accompany the 9H book. equations 1. (p.1), 1.6 (p. 44), 4.6 (p.196) sequences 3. (p.115) Pupils use the Elmwood Press Essential Maths book by David Raymer (9H

### 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

### LINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL

Chapter 6 LINEAR INEQUALITIES 6.1 Introduction Mathematics is the art of saying many things in many different ways. MAXWELL In earlier classes, we have studied equations in one variable and two variables

### In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.

MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target

### Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.

Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job

### Negative Integral Exponents. If x is nonzero, the reciprocal of x is written as 1 x. For example, the reciprocal of 23 is written as 2

4 (4-) Chapter 4 Polynomials and Eponents P( r) 0 ( r) dollars. Which law of eponents can be used to simplify the last epression? Simplify it. P( r) 7. CD rollover. Ronnie invested P dollars in a -year

### Maths Targets Year 1 Addition and Subtraction Measures. N / A in year 1.

Number and place value Maths Targets Year 1 Addition and Subtraction Count to and across 100, forwards and backwards beginning with 0 or 1 or from any given number. Count, read and write numbers to 100

### I know when I have written a number backwards and can correct it when it is pointed out to me I can arrange numbers in order from 1 to 10

Mathematics Targets Moving from Level W and working towards level 1c I can count from 1 to 10 I know and write all my numbers to 10 I know when I have written a number backwards and can correct it when

### 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

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

### Maths Progressions Number and algebra

This document was created by Clevedon School staff using the NZC, Maths Standards and Numeracy Framework, with support from Cognition Education consultants. It is indicative of the maths knowledge and

### Random Fibonacci-type Sequences in Online Gambling

Random Fibonacci-type Sequences in Online Gambling Adam Biello, CJ Cacciatore, Logan Thomas Department of Mathematics CSUMS Advisor: Alfa Heryudono Department of Mathematics University of Massachusetts

EVALUATING ACADEMIC READINESS FOR APPRENTICESHIP TRAINING For ACCESS TO APPRENTICESHIP MATHEMATICS SKILL OPERATIONS WITH INTEGERS AN ACADEMIC SKILLS MANUAL for The Precision Machining And Tooling Trades

### 1 Number System. Introduction. Face Value and Place Value of a Digit. Categories of Numbers

RMAT Success Master 3 1 Number System Introduction In the decimal number system, numbers are expressed by means of symbols 0, 1,, 3, 4, 5, 6, 7, 8, 9, called digits. Here, 0 is called an insignificant

### 13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant

æ If 3 + 4 = x, then x = 2 gold bar is a rectangular solid measuring 2 3 4 It is melted down, and three equal cubes are constructed from this gold What is the length of a side of each cube? 3 What is the

### Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

### Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)

### Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Dirichlet's box principle (pigeon whole principal).

Dirichlet's box principle (pigeon whole principal). If n items are put into m boxes and n > m (that is number of items is greater than number of boxes) then at least one box will contain more than one

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### ALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite

ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,

### Analysis of Binary Search algorithm and Selection Sort algorithm

Analysis of Binary Search algorithm and Selection Sort algorithm In this section we shall take up two representative problems in computer science, work out the algorithms based on the best strategy to

### Probabilities of Poker Hands with Variations

Probabilities of Poker Hands with Variations Jeff Duda Acknowledgements: Brian Alspach and Yiu Poon for providing a means to check my numbers Poker is one of the many games involving the use of a 52-card

### SAT Math Hard Practice Quiz. 5. How many integers between 10 and 500 begin and end in 3?

SAT Math Hard Practice Quiz Numbers and Operations 5. How many integers between 10 and 500 begin and end in 3? 1. A bag contains tomatoes that are either green or red. The ratio of green tomatoes to red

### 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

### Double Deck Blackjack

Double Deck Blackjack Double Deck Blackjack is far more volatile than Multi Deck for the following reasons; The Running & True Card Counts can swing drastically from one Round to the next So few cards

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### Applications for Triangles

Not drawn to scale Applications for Triangles 1. 36 in. 40 in. 33 in. 1188 in. 2 69 in. 2 138 in. 2 1440 in. 2 2. 188 in. 2 278 in. 2 322 in. 2 none of these Find the area of a parallelogram with the given

### 6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise

### Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Read and write numbers to at least 1000 in numerals and in words.

Year 1 Year 2 Year 3 Number, place value, rounding, approximation and estimation Count to and across 100, forwards and backwards, beginning with 0 or 1, or from any given number. Count, read and write

### Using Dividing Plates with the Rotary Table

The premier source of parts and accessories for mini lathes and mini mills. Using Dividing Plates with the Rotary Table Dividing plates allow you to precisely divide a circle into a number of divisions

### The wavelength of infrared light is meters. The digits 3 and 7 are important but all the zeros are just place holders.

Section 6 2A: A common use of positive and negative exponents is writing numbers in scientific notation. In astronomy, the distance between 2 objects can be very large and the numbers often contain many

### 5-1 NUMBER THEORY: DIVISIBILITY; PRIME & COMPOSITE NUMBERS 210 f8

5-1 NUMBER THEORY: DIVISIBILITY; PRIME & COMPOSITE NUMBERS 210 f8 Note: Integers are the w hole numbers and their negatives (additive inverses). While our text discusses only whole numbers, all these ideas

### The Trip Scheduling Problem

The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems

### Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80)

Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80) CS 30, Winter 2016 by Prasad Jayanti 1. (10 points) Here is the famous Monty Hall Puzzle. Suppose you are on a game show, and you

### You know from calculus that functions play a fundamental role in mathematics.

CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

### Section P.9 Notes Page 1 P.9 Linear Inequalities and Absolute Value Inequalities

Section P.9 Notes Page P.9 Linear Inequalities and Absolute Value Inequalities Sometimes the answer to certain math problems is not just a single answer. Sometimes a range of answers might be the answer.

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### We rst consider the game from the player's point of view: Suppose you have picked a number and placed your bet. The probability of winning is

Roulette: On an American roulette wheel here are 38 compartments where the ball can land. They are numbered 1-36, and there are two compartments labeled 0 and 00. Half of the compartments numbered 1-36

### Factoring Patterns in the Gaussian Plane

Factoring Patterns in the Gaussian Plane Steve Phelps Introduction This paper describes discoveries made at the Park City Mathematics Institute, 00, as well as some proofs. Before the summer I understood

### Math Matters: Why Do I Need To Know This? 1 Surface area Home improvement projects with paint

Math Matters: Why Do I Need To Know This? Bruce Kessler, Department of Mathematics Western Kentucky University Episode Six 1 Surface area Home improvement projects with paint Objective: To illustrate how