0
A cleaner tiling argument for the 2×n board recurrence
Open
I can get the recurrence $a_n = a_{n-1} + a_{n-2}$ via casework on the last column, but is there a bijective proof?
Asked by Indrajit Jana · 1 month ago · 14 views
0 Replies
Log in to join the discussion.
No replies yet — be the first to weigh in.