In combinatorial analysis, counting the number of elements in a set of events is often a tricky challenge. When we're dealing with a problem involving an overlap of elements, calculating the number of elements directly can cause duplication. To solve this problem, one of the very useful methods is Inclusion Principal (PIE). This principle allows us to calculate the combined size of some set by avoiding doubling calculations of elements that are sequenced.

What's Inclusion-Principal?

The principle of inclusion is a technique used to calculate the number of elements in a series of sets, by calculating intersection or overlapping between sets. This principle is specified by the basic formula for two sets of AAA and BBB:|A cup B| = |A| + |B| - |A cap B|♪ A B ♪

Here, say|A|♪ A ♪|B|"B"|A cup B|A Reduction|A cap B|To eliminate duplicates of elements in both sets.

This formula can expand to more groups. For three sets of AAA, BBB, and CCC, the inclusion principles can be declared:|A cup B cup C| = |A| + |B| + |C| - |A cap B| - |A cap C| - |B cap C| + |A cap B cap C|♪ A B ♪

This principle can be applied to more and more sets in similar patterns: we add the size of each set, then subtract the intersection of two sets, re-add the intersection of three sets, and so on.

Example Implementation Principal Applementation

One of the classic applications of inclusion principles is to calculate how many integers between 1 and 100 are divided by 2, 3, or 5.

Step-step:

1. Define Compound: Let's say AAA is a set of numbers divided by 2, BBB is a set of numbers divided by 3, and CCC is a set of numbers divisible by 5.
2. Calculate Size of Each Compound:
   • Amount of numbers between 1 and 100 is divisible by 2.|A| "Left floor frame"
   • The number of numbers divided by 3 is|B| "Left floor frac"
   • The amount of numbers divided by 5 is xC.|C| "Lefflfloor frac"
3. Calculate Intersection Size:
   • The number of numbers divided by 6 (multiple 2 and 3) is|A cap B| "Lefflfloor"
   • The number of numbers divisible by 10 (multiple 2 and 5) is|A cap C| "Lefflfloor frac"
   • The amount of numbers that are divisible by 15 (multiple 3 and 5) is equal to "B"|B cap C| = = sync, corrected by elderman = = @ elder _ man
   • Number of numbers divisible by 30|A cap B cap C| "Left floor frame"
4. Apply Inclusion-Principal: Using the formula for three sets:

♪ A B ♪|A cup B cup C| = |A| + |B| + |C| - |A cap B| - |A cap C| - |B cap C| + |A cap B cap C|"A B"

So there are 74 numbers between 1 and 100 that are divided by 2, 3, or 5.

Another Inclusion Principal Applications

Inclusion principles have extensive applications in various combinatorics. A few examples of the application include:

1. Graf Theory: Calculates the number of tied knot pairs or computes the number of cycles in the graph.
2. Number Theory: Calculates the number that has not been shared by some prime numbers using Euler's totient function.
3. Permutation Settings: This principle is also often used in peritation problems with constraints, such as calculating the number of peritation without fixed elements.

Conclusion

The Inclusion principles are a very powerful tool in combinatorial analysis to calculate the combined size of several sets by avoiding doubling calculations on elements that are sequenced. By applying this principle, we can solve many problems involving an efficient overlap. This principle is not only relevant in theory, but it also has practical applications in many fields such as number theory, graph and data processing

source: Tucker, A. Applied Combiorics. John Wiley & Sons.