All public logs

Combined display of all available logs of TCS Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 18:33, 9 April 2024 Roundgod talk contribs created page 组合数学 (Fall 2024)/Problem Set 2 (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</m...")