Solve hanging lantern problem: Difference between revisions

Content added Content deleted

Inline

Revision as of 12:53, 30 May 2022 (view source) Fzh2003 (talk \| contribs) m (Disambiguation) ← Older edit		Revision as of 00:19, 19 June 2022 (view source) Rdm (talk \| contribs) (see talk page) Newer edit →
Line 1:		Line 1:
	{{task}}		{{draft task}}

	There are some columns of lanterns hanging from the ceiling. If you remove the lanterns one at a time, at each step removing the bottommost lantern from one column, how many legal sequences will let you take all of the lanterns down?		There are some columns of lanterns hanging from the ceiling. If you remove the lanterns one at a time, at each step removing the bottommost lantern from one column, how many legal sequences will let you take all of the lanterns down?