- #1
lsepolis123
- 3
- 0
Thread closed as member has not shown any effort, did not use the HW template
how to solve exercise (34) in discrete Math Adv Counting Techniques - see picture===> how apply the formula?
PLEASE click PICTURE to Expand and zoom in , EXAMPLE 5 is end in one paragraph - is the last example the general forumula applies Rosen, Discrete Math and Appl e7 ch.8, Mcgraw hillmicromass said:Your picture is too chaotic and barely readable.
lsepolis123 said:PLEASE click PICTURE to Expand and zoom in , EXAMPLE 5 is end in one paragraph - is the last example the general forumula applies Rosen, Discrete Math and Appl e7 ch.8, Mcgraw hill
Discrete math is a branch of mathematics that deals with countable and finite sets, as opposed to continuous sets. It is used to solve problems related to discrete objects and their properties.
Counting techniques in discrete math involve the use of mathematical methods to determine the number of possible outcomes in a given situation. This includes techniques such as combinations, permutations, and the multiplication principle.
Counting is important in discrete math because it allows us to find the number of possible outcomes in a given situation. This can help us make decisions, solve problems, and understand the properties of discrete objects.
Combinations and permutations are both counting techniques used in discrete math. The main difference between them is that combinations consider the order of the elements to be irrelevant, while permutations take the order into account.
Counting techniques in discrete math are used in a variety of real-life applications, such as in computer science, economics, and genetics. They are used to analyze and solve problems related to decision making, probability, and data analysis.