组合数学 (Spring 2024)/Problem Set 2: 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.

14 May 2024

  • curprev 13:0613:06, 14 May 2024‎ Roundgod talk contribs‎ 5,164 bytes +5,164‎ Created page with "== Problem 1 == Count the number of lattice paths from <math>(0, 0)</math> to <math>(n, n)</math> with steps up and to the right, when two paths are considered equal if one can be moved on top of the other by a rotation or reflection. For example: center|frameless (Hint: Represent a path as a sequence of <math>0</math>s and <math>1</math>s and determine the group that acts on these sequences.) == Problem 2 == Suppose we are given <math>m</math> <math>n<..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=组合数学_(Spring_2024)/Problem_Set_2"