List questions from recursion

Published on 05 Apr 2026 - 12:48

204

Views

Solve recurrences by obtaining a θ bound for T(N) given that T(1) = θ(1)

Published on 06 Feb 2013 - 4:44

439

Views

Computing functions from generating functions

Published on 06 Feb 2013 - 7:29

4k

Views

Recursive definition for $S = \left\{{(a,b) \mid a \in \mathbb{Z}^+, b \in\mathbb{Z}^+ \text{ and } a + b \text{ is odd}}\right\}$

Published on 10 Feb 2013 - 10:13

146

Views

Guidelines for Obtaining Recursive Equations?

Published on 12 Feb 2013 - 18:33

488

Views

Issue while applying Master Theorem

Published on 13 Feb 2013 - 11:49

530

Views

Give a combinatorial proof of the recurrence relation

Published on 01 Apr 2026 - 0:07

239

Views

Rolling 5, 6 sided dice where top 3 equal 15. How many rolls? How in Recursion?

Published on 03 Apr 2026 - 17:58

3.6k

Views

Derive recursion formula for an integral

Published on 26 Feb 2013 - 5:18

150

Views

completeness and creative

Published on 05 Apr 2026 - 17:56

135

Views

Asymptotic bound $T(n)=T(n/3+\lg n)+1$

Published on 08 Mar 2013 - 5:18

832

Views

A Recurrence Relation Involving a Square Root

Published on 08 Mar 2013 - 7:29

101

Views

Closed form for $T(n) = n(T\left(\tfrac {n}{2}\right))^2$

Published on 13 Mar 2013 - 5:11

3.5k

Views

Give a recursive definition with initial condition...how did they get the answer?

Published on 13 Mar 2013 - 5:12

979

Views

How to solve infinitely nested logarithms

Published on 13 Mar 2013 - 7:09

List Question

Are the brackets in formal box notation of recursive functions omittable?

Solve recurrences by obtaining a θ bound for T(N) given that T(1) = θ(1)

Computing functions from generating functions

Recursive definition for $S = \left\{{(a,b) \mid a \in \mathbb{Z}^+, b \in\mathbb{Z}^+ \text{ and } a + b \text{ is odd}}\right\}$

Guidelines for Obtaining Recursive Equations?

Issue while applying Master Theorem

Give a combinatorial proof of the recurrence relation

Rolling 5, 6 sided dice where top 3 equal 15. How many rolls? How in Recursion?

Derive recursion formula for an integral

completeness and creative

Asymptotic bound $T(n)=T(n/3+\lg n)+1$

A Recurrence Relation Involving a Square Root

Closed form for $T(n) = n(T\left(\tfrac {n}{2}\right))^2$

Give a recursive definition with initial condition...how did they get the answer?

How to solve infinitely nested logarithms

Trending Questions

Popular # Hahtags

Popular Questions