by stupidityismygam » Sun Apr 05, 2009 2:21 pm
Yes. Here is my solution.
There are a total of [unparseable or potentially dangerous latex formula] subsets. Let's find the number of subsets that have no consecutive elements. Let [unparseable or potentially dangerous latex formula] elements of the subsets with [unparseable or potentially dangerous latex formula] Define [unparseable or potentially dangerous latex formula] The elements of [unparseable or potentially dangerous latex formula] are restricted to the set [unparseable or potentially dangerous latex formula] There is a bijection between the possible nonconsecutive [unparseable or potentially dangerous latex formula] with the number of possible [unparseable or potentially dangerous latex formula] There are [unparseable or potentially dangerous latex formula] possible [unparseable or potentially dangerous latex formula] combinations so there are the same number of nonconsecutive elements. This leaves us with [unparseable or potentially dangerous latex formula] consecutive 5-element subsets.
my avatar is pretty awesome
tytia