1 answer
1
How many ways are there to seat six people around circular table where two seatings are considered same when everyone has same two neighbors without regard to whether the...
2 answers
3
It's a question from Cormen book Exercise 4.4-5 and is described like this:Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+...
5 answers
4
Please tell me the complete steps how to solve this problem.$ T(n) = T ( \sqrt n )+ 1$
1 answer
11
$\sum_{j \in S} 1$ where S = {1, 3, 5, 7}.if we have $\sum_{j = 1}^{n} 1$ then the answer will be n. But what happens if this a set?
1 answer
14
$(a) \sum_{k = 0}^{m} \left \lfloor \sqrt k \right \rfloor$$(b) \sum_{k = 0}^{m} \left \lfloor \sqrt {k^{3}} \right \rfloor$Is there any quick way to find the formula for...