Question

Singularities of complex exponential and asymptotic expansion

score 164 · Answer 1 · 2026-03-31 17:52:23

164

Views

Singularities of complex exponential and asymptotic expansion

Published on 31 Mar 2026 - 17:52

score 418 · Answer 2 · 2014-12-13 18:27:25

418

Views

Define function F which is big O but not big theta

Published on 13 Dec 2014 - 18:27

score 51 · Answer 3 · 2014-12-14 06:08:32

51

Views

For what sequences $a_n$ does the sequence $(1+\alpha a_n)^n$ converge?

Published on 14 Dec 2014 - 6:08

score 211 · Answer 4 · 2014-12-14 10:06:06

211

Views

Explain why $f = O(g)$ for $f(n) = (2^{n} + 2n^{2})^{1/5}$ and $g(n) = 4n^{5} + 8n + 2\log(n)$

Published on 14 Dec 2014 - 10:06

score 163 · Answer 5 · 2026-04-06 02:49:57

163

Views

Asymptotic Notations Iterative Method for Solving Recurrences

Published on 06 Apr 2026 - 2:49

score 174 · Answer 6 · 2014-12-14 13:31:03

174

Views

Big oh notation

Published on 14 Dec 2014 - 13:31

score 127 · Answer 7 · 2026-03-25 11:13:28

127

Views

Asymptotic elementary expression for the antiderivative of $x^x$

Published on 25 Mar 2026 - 11:13

score 282 · Answer 8 · 2026-03-28 13:37:29

282

Views

Big-$\mathcal{O}$ notation for CRT and Extended Euclidean Algorithm

Published on 28 Mar 2026 - 13:37

score 188 · Answer 9 · 2014-12-19 00:23:12

188

Views

How does $\log(x^2 + 1)$ become $\log(2x^2)$?

Published on 19 Dec 2014 - 0:23

score 392 · Answer 10 · 2014-12-19 02:34:31

392

Views

Verify answers to these big o notation questions

Published on 19 Dec 2014 - 2:34

score 2.2k · Answer 11 · 2014-12-19 05:27:50

2.2k

Views

Determine whether each of the functions $2^{n+1}$ and $2^{2n}$ is $O(2^n)$.

Published on 19 Dec 2014 - 5:27

score 309 · Answer 12 · 2026-04-06 04:41:00

309

Views

How to solve a recurrence relation such as $T(n) = 2T(\frac{n}{2}) +$ $\frac{n}{\log (n)}$?

Published on 06 Apr 2026 - 4:41

score 4.8k · Answer 13 · 2014-12-20 00:00:39

4.8k

Views

Big $O$ estimate of $(n\log n+1)^2+ (\log n +1)(n^2+1)$

Published on 20 Dec 2014 - 0:00

score 117 · Answer 14 · 2026-04-06 04:41:13

117

Views

If $T(n+1)=T(n)+\lfloor \sqrt{n+1}, \rfloor$ $\forall n\geq 1$, what is $T(m^2)$?

Published on 06 Apr 2026 - 4:41

score 68 · Answer 15 · 2014-12-21 16:41:52

68

Views

Why $\frac{1}{nh}O(h)=o[(nh)^{-1}]$ and $O_p(h^2+(nh)^{-1/2})=o_p(1)$

Published on 21 Dec 2014 - 16:41

List Question

Singularities of complex exponential and asymptotic expansion

Define function F which is big O but not big theta

For what sequences $a_n$ does the sequence $(1+\alpha a_n)^n$ converge?

Explain why $f = O(g)$ for $f(n) = (2^{n} + 2n^{2})^{1/5}$ and $g(n) = 4n^{5} + 8n + 2\log(n)$

Asymptotic Notations Iterative Method for Solving Recurrences

Big oh notation

Asymptotic elementary expression for the antiderivative of $x^x$

Big-$\mathcal{O}$ notation for CRT and Extended Euclidean Algorithm

How does $\log(x^2 + 1)$ become $\log(2x^2)$?

Verify answers to these big o notation questions

Determine whether each of the functions $2^{n+1}$ and $2^{2n}$ is $O(2^n)$.

How to solve a recurrence relation such as $T(n) = 2T(\frac{n}{2}) +$ $\frac{n}{\log (n)}$?

Big $O$ estimate of $(n\log n+1)^2+ (\log n +1)(n^2+1)$

If $T(n+1)=T(n)+\lfloor \sqrt{n+1}, \rfloor$ $\forall n\geq 1$, what is $T(m^2)$?

Why $\frac{1}{nh}O(h)=o[(nh)^{-1}]$ and $O_p(h^2+(nh)^{-1/2})=o_p(1)$

Trending Questions

Popular # Hahtags

Popular Questions