Suppose you are give $n$ currency notes from $k$ to $k+n$
i.e $k, k+1,k+2.....k+n$
It's asked the total number of denomination of money that can't be formed using any number of these notes.
I can solve this when n=1. Ans is k*(k-1)/2 But How should i approach when n ≥1?