DISCRETE MATHEMATICS

ASSIGNMENT 2 - UNIT 2

1. Using the inclusion-exclusion principle, find the number of integers from a set of 1-100
that are not divisible by 2, 3 and 5. (26)
2. At a software company, skilled workers have been hired for a project. Out of 75
candidates, 48 of them were software engineer; 35 of them were hardware engineer; 42
of them were network engineer; 18 of them had skills in all three jobs and all of them
had skills in at least one of these jobs. How many candidates were hired who were
skilled in exactly 2 jobs? (14)
3. A box contains 6 red, 8 green, 10 blue, 12 yellow and 15 white balls. What is the
minimum no. of balls we have to choose randomly from the box to ensure that we get
9 balls of same color? (39)
4. A drawer contains 12 red and 12 blue socks, all unmatched. A person takes socks out at
random in the dark. How many socks must he take out to be sure that he has at least
two blue socks? (14)
5. A bag contains 25 balls such as 10 balls are red, 7 are white and 8 are blue. What is the
minimum number of balls that must be picked up from the bag blindfolded (without
replacing any of it) to be assured of picking at least one ball of each colour? (19)
6.  From a group of 7 men and 6 women, five persons are to be selected to form a
committee so that at least 3 men are there in the committee. In how many ways can it
be done? (756)
7. How many 6 digit telephone numbers can be formed if each number starts with 35 and
no digit appears more than once? (1680)
8. A company has 10 software engineers and 6 civil engineers. In how many ways can they
be seated around a round table so that all the civil engineers are together? (10! × 6!)
9. Naresh has 10 friends and he wants to invite 6 of them to a party. How many times will
3 particular friends always attend the party? (35)
10. A farmer purchased 3 cows, 2 pigs, and 4 hens from a man who has 6 cows, 5 pigs, and 8
hens. Find the number m of choices that the farmer has. (14000)