Skip to main content

DISCRETIVE MATHAMATICS

   

        DISCRETIVE MATHAMATICS

THIS BLOG ABOUT ALL DISCRETIVE MATHAMATICS

TODAY ZOOM MEETING 22/06/2021

1Q:- How many different bit strings of length seven  are there?


Solution:


  

STEP:-1 STRING LENTH SEVEN SO 7 PLACES
STEP :2 CAN STORE IN COMPUTER IN 0 OR 1 BIT TWO WAYS CAN STORE
STEP :3 __ __ __ __ __ __ __ PUT 2 IN ALL PLACES BECAUSE 1 OR 0 POSSIBLE
WAYS
STEP:4 2X2X2X2X2X2X2 =128 OR 27 = 128

Each of the seven bits can be chosen in two  ways, because each bit is either 0 or 1. Therefore, the product rule shows there are a  total of 27 = 128 different bit strings of length seven.


2Q:-β€’ Example: 

How many different license plates can be made if each plate contains a sequence of three uppercase English letters followed by three digits?

β€’ Solution: 

STEP:-1 THREE LETTERS AND THREE DIGITS SO TOTAL 6 PLACES 
                 __  __  __  __   __  __
STEP:-2 first place have 26 choices any one letter can write it place

STEP:-3 second place also same 

STEP:-4 third place also same
 
STEP:-5 4th place will filled with digits have 10 choices can fill any one of them

STEP:-6 5th place will fill also same 10 choices  

STEP:-7 6th place will fill also same 10 choices 

STEP:-8  finally 26x26x26 first three letters and 10x10x10 last three digits total
                26x26x26x10x10x10 = 17,576,000 
             17,576,000 possible license plates
 There are 26 choices for each of the three uppercase English letters and ten choices for each of the three digits. Hence, by the product rule there are a total of 

26 Β· 26 Β· 26 Β· 10 Β· 10 Β· 10 = 17,576,000 possible license plates.



3Qβ€’ Example

Suppose that either a member of the mathematics faculty or a student who is a mathematics major is chosen as a representative to a university committee. How many different choices are there for this representative if there are 37 members of the mathematics faculty and 83 mathematics majors and no one is both a faculty member and a student?

β€’ Solution: 

STEP:-1 can choose representative of committe one person of student either faculty any one of them


STEP:-2  there are 37 members of faculty and 83 persons of students 


STEP:-3 how many diffirent choices to select the committee persons is  total is 37+83 choices is there


STEP:-4 pick one person only so the answer is 120 choices to pick or select any of them


There are 37 ways to choose a member of the mathematics faculty and there are 83 ways to choose a student who is a mathematics major. Choosing a member of the mathematics faculty is never the same as choosing a student who is a mathematics major because no one is both a faculty member and a student. By the sum rule it follows that there are  37 + 83 = 120 

possible ways to pick this representative.


4Qβ€’ Example: 
A student can choose a computer project from one of three lists. The three lists contain 23, 15,and 19 possible projects, respectively. No project is on more than one list. How many possible projects are there to choose from? lists.

STEP:-1   THERE ARE 3 LISTS OF COMPUTER PROJECTS ,THE LISTS 23, 15,AND 19                                    POSSIBLE PROJECTS

STEP:-2  A STUDENT CAN CHOOSE ONE PROJECT OF GIVEN 3 LISTS 

STEP:-3  SO HOW MANY POSSIBLE PROJECTS TO CHOOSE THAT GUY

STEP:-4 TOTAL  23+15+19  CHOICES TO PICK ANY ONE OF THEM

STEP:-5 SO ANSWER IS 57 WAYS TO PICK THE ONE PROJECT

The student can choose a project by selecting  a projrct from the first list, the second list, or  from the first list, the second list, or  from the first list, the second list, or  the third list. Because no project is on more  than on list, by the sum rule there are list, by the sum rule there are 23 + 15 + 19 = 57 ways to choose a project.


5QExample: 

How many ways are there to select a first prize winner, a second-prize winner, and a third-prize winner from 100 different people who have entered a contest?

β€’ Solution: 

WE HAVE USED THIS FORMULA P(n,r)=n(n βˆ’ 1)(n βˆ’ 2) Β· Β· Β· (n βˆ’ r + 1)

STEP: 1 REMEBER THAT ABOVE FORMULA

STEP :2 NUMBER PEOPLES PARTCIPATE IN CONTEST (n)=100

STEP :3 THRE ARE THREE PRIZES FROM 100 PEOPLES SO

STEP :4 FIRST PRIZE GIVEN BY ONE PERSON OUT OF 100

SECOND PRIZE GIVEN BY ONE PERSON OUT OF 99

THIRD PRIZE GIVEN BY ONE PERSON OUT OF 98
SO 100 X 99 X 98 = 970,200

OR

STEP :1 FIRST PRIZE GIVE S TO ANY ONE OF THEM OUT OF 100 SO IT IS 100 WAYS TO
SELECT REMAING 99

STEP :2 SECOND PRIZE GIVES TO ANY ONE OF THEM OUT OF 99 SO IT IS 99 WAYS TO
SELECT REMAING 98

STEP:3 THIRD PRIZE GIVS TO ANY ONE OF THEM OUT OF 98 SO IT IS 98 WAYS TO
SELECT THE PRIZE
EACH WAY IS SELECTION IS COMPLITED

STEP:4 WE WANT TOTAL WAYS TO SELECT THREE PRIZES OUT OF 100 MEMBERS IS 100 X
99 X 98

Because it matters which person wins which prize, the number of ways to pick the three prize winners is the number of ordered elections of three elements from a set of 100 elements, that is, the number of 3- permutations of a set of 100 elements. Consequently, the answer is 

P(100, 3) = 100 Β· 99 Β· 98 = 970,200.

------*** END ***-----------

24/06/2021 ZOOM CLASS

6Qβ€’ Example: 

Suppose that a saleswoman has to visit eight  different cities. She must begin her trip in a  specified city, but she can visit the other seven  cities in any order she wishes. How many  possible orders can the saleswoman use when  visiting these cities?

β€’ Solution: 


STEP :-1 THE WOMEN HAS TO VISIT EIGHT CITIES BUT SHE MUST START ANY ONE OF THESE CITIES

SO SHE VISIT 7 CITIES

STEP :-2 THE PLACES ARE 7 THE POSSIBLE WAYS ARE 7!


STEP:-3 __ __ __ __ __ __ __

7 x 6 x 5 x 4 x 3 x 2 x 1


STEP :- 4 7 x 6 x 5 x 4 x 3 x 2 x 1 = 5040


{ OR }


The number of possible paths between the cities is the number of permutations of seven elements, because the first city is determined, but the remaining seven can be ordered 

arbitrarily. Consequently, there are 

7! = 7 Β· 6 Β· 5 Β· 4 Β· 3 Β· 2 Β· 1 = 5040 

ways for the sales woman to choose her tour. If, for instance, the saleswoman wishes to find the path between the cities with minimum distance, and she computes the total distance for each possible path, she must consider a total of 5040 paths!


7Qβ€’ Example: 

How many permutations of the letters ABCDEFGH contain the string ABC ?

β€’ Solution:

STEP :-1 THE GIVEN LETTERS ARE ABCDEFGH TOTAL 8 LETTERS CONTAINS A STRING ABC

STEP :- 2 IN GIVEN LETTERS ALREADY A STRING ABC CAN MUST FORM A BLOCK 

STEP :- 3 SO REMAINING D, E, F, G, H ARE 5 LETTERS TOTAL HAVE 6 BLOCKS

THE POSSIBLE WAYS ARE 6!


STEP :- 4 ABC __ __ __ __ __ ANY ONE OF LETTERS ARE POSSIBLE IN SPACES EXCEPT ABC

STEP:- 5 ___ __ __ __ __ __

6 x 5 x 4 x 3 x 2 x 1

STEP:- 6 6 x 5 x 4 x 3 x 2 x 1 = 720

{ OR }

Because the letters ABC must occur as a block, we can find the answer by finding the number of permutations of six objects, namely, the block ABC and the individual letters D, E,F, G, and H. Because these six objects can occur in any order, there are 

6! = 720 

permutations of the letters ABCDEFGH in which ABC occurs as a block.



7Q EXAMPLE
HOW MANY PERMUTATION OF THE LETTER A B C D E F G CONTAINS
(a) A STRING BCD
(b) A STRING CONTAINS CFGA ?
(c) THE STRINGS BA AND GF ?
(d) THE STRINGS ABC AND DE ?
(e) THE STRINGS ABC AND CDE ?
(f) THE STRINGS CBA AND BED ?

SOLUTION :
(a) A STRING BCD
STEP:- 1 THE GIVEN LETTERS ABCDEFG TOTAL 7 IT MUST CONTAIN BCD BLOCK
STEP:-2 SO TAKE A SIDE OF BCD ONE BLOCK REMAINING 4 LETTERS AS 4 BLOCKS
STEP:- 3 WE HAVE TOTAL 1 +4 = 5 SPACES OR BLOCKS SO 5! WAYS
STEP :- 4 BCD __ __ __ __ ANY ONE OF LETTERS ARE POSSIBLE IN SPACES EXCEPT BCD
STEP:- 5 ___ __ __ __ __

5 x 4 x 3 x 2 x 1

STEP:- 6 5 x 4 x 3 x 2 x 1 = 5! = 120 WAYS

(b) A STRING CONTAINS CFGA ?

STEP:- 1 WE HAVE CFGA AS A BLOCK REMAINING B D E ARE 3 BLOCKS SO TOTAL 4 BLOCKS
STEP:- 2 TOTAL 4 BLOCKS SPACES ALSO 4 THEN POSSIABLE WAYS ARE 4!
STEP :- 3 CFGA __ __ __ ANY ONE OF LETTERS ARE POSSIBLE IN SPACES EXCEPT CFGA
STEP:- 4 ___ __ __ __

4 x 3 x 2 x 1

STEP:- 5 4 x 3 x 2 x 1 = 4! = 24 WAYS
(c) THE STRINGS BA AND GF ?

STEP:- 1 WE HAVE BA AND GF BLOCKS MUST REMAINING ARE C D E TOTAL 5 BLOCKS
STEP:- 2 SO SPACES ALSO 5 POSSIBLE WAYS ALSO 5!
STEP :- 3 BA GF __ __ __ ANY ONE OF LETTERS ARE POSSIBLE IN SPACES EXCEPT BA AND GF
STEP:- 4 ___ __ __ __ __

5 x 4 x 3 x 2 x 1

STEP:- 5 5 x 4 x 3 x 2 x 1 = 5! = 120 WAYS


(d) THE STRINGS ABC AND DE ?

STEP:- 1 WE HAVE ABC AND DE ARE TWO BLOCKS REMAINING F G ARE 2 BLOCKS TOTAL 4 SO 4
SPACES
STEP:- 2 THE POSSIBLE WAYS ARE 4!
STEP :- 3 ABC DE __ __ ANY ONE OF LETTERS ARE POSSIBLE IN SPACES EXCEPT ABC AND DE
STEP:- 4 ___ __ __ __

4 x 3 x 2 x 1

STEP:- 5 4 x 3 x 2 x 1 = 4! = 24 WAYS
(e) THE STRINGS ABC AND CDE ?

STEP:- 1 ABC AND CDE ARE TWO STRINGS .THEY CONTAIN COMMON LETTER C
STEP:- 2 WE INCLUDE ABC AND CDE LIKE ABCDE THE C LETTER NOT TAKE TWICE IN THE
PERMUTATION
STEP:- 3 SO ABCDE ARE ONE BLOCK OR STRING REMAINING ARE F G TOTAL 3 STRINGS
STEP:-4 SPACES ALSO 3 AND POSSIBLE WAYS ARE 3!
STEP :- 5 ABCDE __ __ ANY ONE OF LETTERS ARE POSSIBLE IN SPACES EXCEPT ABCDE
STEP:- 6 _____ __ __

3 x 2 x 1

STEP:- 7 3 x 2 x 1 = 3! = 6 WAYS

(f) THE STRINGS CBA AND BED ?

STEP:-1 IN CBA AND BED WE INCLUDE BUT B LETTER CAN APPEAR TWICE
STEP:- 2 IN PERMUTATION REPEATED IS NOT ALLOWED
STEP :- 3 IN GIVEN SUM THE NUMBER OF PERMUTATION =0
------*** END ***-----------

26/06/2021 ZOOM CLASS

Combinations

 a combination is a selection of items from a collection, such that (unlike permutations) the order of selection does not matter. 


THEOREM:

8Q EXAMPLE

How many ways are there to select five players from a 10-member tennis team to make a trip to a match at another school?

β€’ Solution: 

The answer is given by the number of 5- combinations of a set with 10 elements.


C(10,5) = 10!/5!5! =252
9Q EXAMPLE

A group of 30 people have been trained as astronauts to go on the first mission to Mars. How many ways are there to select a crew of six people to go on this mission (assuming that all crew members have the same job)?

β€’ Solution: 

The number of ways to select a crew of six from the pool of 30 people is the number of 6-combinations of a set with 30 elements, because the order in which these people are chosen does not matter
C(30,6)=30!/6! =30.29.28.27.26.25 /6.5.4.3.2.1 =593,775

10 Q EXAMPLE
Suppose that there are 9 faculty members in the mathematics department and 11 in the computer
science department. How many ways are there to select a committee to develop a discrete
mathematics course at a school if the committee is to consist of three faculty members from the
mathematics department and four from the computer science department?

β€’ Solution: 


By the product rule, the answer is the product of the number of 3-combinations of a set with nine elements and the number of 4- combinations of a set with 11 elements.

11 Q EXAMPLE

How many bit strings of length eight either start with a 1 bit or end with the two bits 00?

β€’ Solution:










128 + 64 βˆ’ 32 = 160.

------*** END ***-----------

















































































































Comments