Tessellate S.T.E.M.S. (2019) - Computer Science - School - Set 1 - Objective Problem 5

Level 2

Find the number of n n -tuples ( a 1 , a 2 , … , a n ) (a_1,a_2,\ldots, a_n) where each a i ∈ { 0 , 1 } a_i\in \{0,1\} , such that, a 1 ≤ a 2 ≥ a 3 ≤ … a_1\leq a_2\geq a_3\leq \ldots .

This problem is a part of Tessellate S.T.E.M.S (2019)

n ( n − 1 ) 2 \frac{n(n-1)}{2} f i b n + 2 fib_{n+2} 1 1 2 n 2^n

Tessellate Stems Computer Science by Tessellate STEMS Compute… , 27

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...