组合数学 (Fall 2019)/Pólya's theory of counting: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

8 October 2019

  • curprev 06:1606:16, 8 October 2019‎ imported>Etone‎ 19,696 bytes −14,274‎ No edit summary
  • curprev 06:1506:15, 8 October 2019‎ imported>Etone‎ 33,970 bytes +33,970‎ Created page with "== Principle of Inclusion-Exclusion == Let <math>A</math> and <math>B</math> be two finite sets. The cardinality of their union is :<math>|A\cup B|=|A|+|B|-{\color{Blue}|A\cap..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Fall_2019)/Pólya%27s_theory_of_counting"