Search results

  • ...erating functions]] or the [[Principle of Inclusion-Exclusion|principle of inclusion-exclusion]]. Combinatorics also has many applications outside of pure mathematics, no ...e in the sense that people know how to count lists of numbers, enumeration problems are (typically) not nearly as simple as counting a list of numbers. One mus
    1 KB (208 words) - 01:12, 4 October 2020
  • The '''Principle of Inclusion-Exclusion''' (abbreviated PIE) provides an organized method/formula to find the numbe [[2011 AMC 8 Problems/Problem 6]]
    9 KB (1,703 words) - 00:20, 7 December 2024
  • ...y important counting tools such as [[combinations]] and the [[Principle of Inclusion-Exclusion]]. * [[2004 AIME I Problems/Problem 3|AIME 2004I/3]]
    4 KB (635 words) - 11:19, 2 January 2022
  • Now, we use the [[Principle of Inclusion-Exclusion]]. We have <math>121 + 64 + 276</math> total potential divisors so far, bu [[Category:Introductory Number Theory Problems]]
    3 KB (377 words) - 17:36, 1 January 2024
  • We use the [[Principle of Inclusion-Exclusion]] (PIE). [[Category:Intermediate Combinatorics Problems]]
    4 KB (620 words) - 20:26, 5 June 2021
  • However, this [[Principle of Inclusion-Exclusion|overcounts]] the instances in which the trio sits together; when all three [[Category:Intermediate Combinatorics Problems]]
    9 KB (1,464 words) - 10:50, 30 October 2024
  • ...djacent Birch trees using complementary counting and then the Principle of Inclusion-Exclusion. * [[AIME Problems and Solutions]]
    7 KB (1,115 words) - 23:52, 6 September 2023
  • ...of terms in <math>T</math> is <math>23+8-2=29</math> by the [[Principle of Inclusion-Exclusion]], fulfilling our original requirement of <math>n-T=500</math>. [[Category:Intermediate Algebra Problems]]
    2 KB (283 words) - 22:11, 25 June 2023
  • ...direct combinatorics way to calculate <math>m/n</math>. The [[Principle of Inclusion-Exclusion]] still requires us to find the individual probability of each box. [[Category:Intermediate Number Theory Problems]]
    7 KB (1,011 words) - 19:09, 4 January 2024
  • By the [[Principle of Inclusion-Exclusion]], the total probability is [[Category:Intermediate Combinatorics Problems]]
    4 KB (538 words) - 19:10, 16 September 2024
  • By the [[Principle of Inclusion-Exclusion]], there are (alternatively subtracting and adding) <math>128-40+8-1=95</ma [[Category:Intermediate Combinatorics Problems]]
    8 KB (1,207 words) - 13:39, 30 June 2024
  • ...t\lfloor 40\% \cdot 2001 \right\rfloor = 800</math>. By the [[Principle of Inclusion-Exclusion]], [[Category:Intermediate Combinatorics Problems]]
    2 KB (252 words) - 23:54, 9 January 2024
  • ...math>k</math> (<math>j < k</math>) here. We can now use the [[Principle of Inclusion-Exclusion]] based on the stipulation that <math>j\ne k</math> to solve the problem: [[Category:Intermediate Combinatorics Problems]]
    13 KB (2,328 words) - 23:12, 28 November 2023
  • We can calculate <math>S_2 \cup S_3 \cup S_5</math> using the [[Principle of Inclusion-Exclusion]]: (the values of <math>|S_2| \ldots</math> and their intersections can be [[Category:Introductory Number Theory Problems]]
    2 KB (277 words) - 17:15, 25 November 2020
  • ...units place (counting <math>2004</math>). Now we apply the [[Principle of Inclusion-Exclusion]]. There are <math>20</math> numbers with a 4 in the hundreds and in the te [[Category:Introductory Algebra Problems]]
    4 KB (536 words) - 17:50, 26 November 2024
  • ...s into the above category, so we do not have to worry about [[Principle of Inclusion-Exclusion|overcounting]]). [[Category:Intermediate Combinatorics Problems]]
    7 KB (1,114 words) - 02:41, 12 September 2021
  • ...P(b) = \frac{2}{6} = \frac 13</math> that Amal does. By the [[Principle of Inclusion-Exclusion]], [[Category:Introductory Combinatorics Problems]]
    2 KB (317 words) - 09:26, 5 November 2023
  • ...>, of which there are <math>10</math> possibilities. By the [[Principle of Inclusion-Exclusion]], [[Category:Introductory Combinatorics Problems]]
    2 KB (330 words) - 09:14, 10 August 2016
  • ...rs equal to any in <math>455=5*7*13</math>. Thus we use the [[Principle of Inclusion-Exclusion]] and [[complementary counting]]: [[Category:Introductory Combinatorics Problems]]
    1 KB (223 words) - 10:30, 18 September 2008
  • By complementarity and principle of inclusion-exclusion, the probability of that is <math>1- \left( \left( \frac{8}{9}\right)^n + \ [[Category:Olympiad Combinatorics Problems]]
    3 KB (586 words) - 11:26, 29 July 2024

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)