Question

Given n chocolates, yuo canremove either 1 or 3 any time. Find number of ways to finish all chocol ates

Answer 1

n-1 or n-2 as
1) 3+1+1+1+...+n
2)3+3+1+1+...+n
.
.
.
n-2) (n-2)3+1+1
or
n-1) (n-1)3+1