Question

how to disprove that a function is in the big O of another function

score 55 · Answer 1 · 2018-03-11 03:31:17

55

Views

how to disprove that a function is in the big O of another function

Published on 11 Mar 2018 - 3:31

score 92 · Answer 2 · 2018-03-11 07:42:21

92

Views

2 improprer integrals:converge or diverge

Published on 11 Mar 2018 - 7:42

score 156 · Answer 3 · 2018-03-11 08:01:17

156

Views

Is $\sqrt n = \omega (log^{300}n)$?

Published on 11 Mar 2018 - 8:01

score 704 · Answer 4 · 2018-03-11 21:13:08

704

Views

How to find a dominant term?

Published on 11 Mar 2018 - 21:13

score 1.4k · Answer 5 · 2026-03-25 12:51:02

1.4k

Views

Complexity (prove or disprove): If $f(g(n))=O(n)$ and $f(n)=Ω(n)$ then $g(n)=O(n)$

Published on 25 Mar 2026 - 12:51

score 257 · Answer 6 · 2026-03-25 06:21:42

257

Views

Growth Rate of Power of 2 Partition Function

Published on 25 Mar 2026 - 6:21

score 110 · Answer 7 · 2018-03-13 04:58:26

110

Views

If $f(n)$ is $\mathcal{O}(g(n))$, then prove sum of $f(x)$ is not $\mathcal{O}(n\cdot g(n))$

Published on 13 Mar 2018 - 4:58

score 31 · Answer 8 · 2018-03-13 13:14:58

31

Views

Getting the two highest order terms in the sum $\sum_{j=0}^n j^k \left(\frac{n^2}{j(n-2)}\right)^j$

Published on 13 Mar 2018 - 13:14

score 76 · Answer 9 · 2018-03-13 14:04:56

76

Views

Asymptotic behavior of the geometric sequence $U_{n+1}=QU_n$ in a probability problem

Published on 13 Mar 2018 - 14:04

score 1.2k · Answer 10 · 2018-03-13 21:19:28

1.2k

Views

Edges in a line graph

Published on 13 Mar 2018 - 21:19

score 80 · Answer 11 · 2018-03-13 23:51:57

80

Views

Show $E[T(n)] \in \Omega(n\cdot\log(n))$

Published on 13 Mar 2018 - 23:51

score 282 · Answer 12 · 2026-03-25 09:34:56

282

Views

Asymptotic expansion of inverse Laplace transform of $z^{-1} \tanh(z)$

Published on 25 Mar 2026 - 9:34

score 28 · Answer 13 · 2018-03-14 18:22:33

28

Views

approximation of the sum of prime superior to the sum of integer?

Published on 14 Mar 2018 - 18:22

score 24 · Answer 14 · 2018-03-15 10:33:59

24

Views

Time complexity for the following algorithm with loops

Published on 15 Mar 2018 - 10:33

score 47 · Answer 15 · 2018-03-16 00:47:59

47

Views

Show $\sum\limits_1 ^x \frac{f(n)}{g(n)} \sim x $

Published on 16 Mar 2018 - 0:47

List Question

how to disprove that a function is in the big O of another function

2 improprer integrals:converge or diverge

Is $\sqrt n = \omega (log^{300}n)$?

How to find a dominant term?

Complexity (prove or disprove): If $f(g(n))=O(n)$ and $f(n)=Ω(n)$ then $g(n)=O(n)$

Growth Rate of Power of 2 Partition Function

If $f(n)$ is $\mathcal{O}(g(n))$, then prove sum of $f(x)$ is not $\mathcal{O}(n\cdot g(n))$

Getting the two highest order terms in the sum $\sum_{j=0}^n j^k \left(\frac{n^2}{j(n-2)}\right)^j$

Asymptotic behavior of the geometric sequence $U_{n+1}=QU_n$ in a probability problem

Edges in a line graph

Show $E[T(n)] \in \Omega(n\cdot\log(n))$

Asymptotic expansion of inverse Laplace transform of $z^{-1} \tanh(z)$

approximation of the sum of prime superior to the sum of integer?

Time complexity for the following algorithm with loops

Show $\sum\limits_1 ^x \frac{f(n)}{g(n)} \sim x $

Trending Questions

Popular # Hahtags

Popular Questions