Question

Is it sufficient to show the following inequality holds to prove $2^{2^n} \in \Omega(n!)$?

score 30 · Answer 1 · 2026-03-26 08:02:31

30

Views

Is it sufficient to show the following inequality holds to prove $2^{2^n} \in \Omega(n!)$?

Published on 26 Mar 2026 - 8:02

score 48 · Answer 2 · 2026-03-27 17:06:26

48

Views

Difficulty in understanding a derivation : Asymptotic behaviour of binomial coeeficients

Published on 27 Mar 2026 - 17:06

score 1.9k · Answer 3 · 2026-03-25 12:37:37

1.9k

Views

Why does an indeterminate cause a hole in a rational function and not a vertical asymptote?

Published on 25 Mar 2026 - 12:37

score 141 · Answer 4 · 2026-03-26 07:58:21

141

Views

True or False: $(n + \log(n))(n+8)$ is $O(n)$

Published on 26 Mar 2026 - 7:58

score 192 · Answer 5 · 2018-09-19 23:44:54

192

Views

Asymptotic growth of $\sum_{k=1}^{n}\frac{\left(-1\right)^{k+1}\binom{n}{k}}{1-p^{k}}$ as $n \to \infty$

Published on 19 Sep 2018 - 23:44

score 53 · Answer 6 · 2026-03-26 09:47:00

53

Views

True or false: $n^2 + 2n^2 + 3n^2 + 4n^2 + ... n(n^2)$ is $O(n^2)$

Published on 26 Mar 2026 - 9:47

score 212 · Answer 7 · 2018-09-20 15:55:09

212

Views

Signs of Maclaurin coefficients of $\frac{1}{e^x+q}$

Published on 20 Sep 2018 - 15:55

score 3.5k · Answer 8 · 2026-03-26 08:03:46

3.5k

Views

Solving a recurrence relation with floor function

Published on 26 Mar 2026 - 8:03

score 18 · Answer 9 · 2018-09-20 16:52:40

18

Views

Equations of asymptotic notations

Published on 20 Sep 2018 - 16:52

score 59 · Answer 10 · 2018-09-20 21:02:16

59

Views

Can we compute $X^n$ faster than $O(\log n)$?

Published on 20 Sep 2018 - 21:02

score 230 · Answer 11 · 2018-09-21 09:00:12

230

Views

Small-o asymptotic notation and inequality

Published on 21 Sep 2018 - 9:00

score 179 · Answer 12 · 2018-09-21 17:38:59

179

Views

How to prove that $O(n) \cdot O(n^2) = O(n^3)$?

Published on 21 Sep 2018 - 17:38

score 138 · Answer 13 · 2018-09-22 02:30:39

138

Views

Prove or disprove: If $O(\;f(n)\,O(g(n))\;)\in O(\;f(n)\,g(n)\;)$, then $O(\;f(n)\,g(n)\;) \in f(n)\,O(g(n))$

Published on 22 Sep 2018 - 2:30

score 467 · Answer 14 · 2018-09-24 08:04:11

467

Views

Asymptotically analyzing growth rate of matrix entries

Published on 24 Sep 2018 - 8:04

score 338 · Answer 15 · 2018-09-24 16:26:27

338

Views

Root-$n$ consistency of an estimator implies its variance is $O(n^{-1})$

Published on 24 Sep 2018 - 16:26

List Question

Is it sufficient to show the following inequality holds to prove $2^{2^n} \in \Omega(n!)$?

Difficulty in understanding a derivation : Asymptotic behaviour of binomial coeeficients

Why does an indeterminate cause a hole in a rational function and not a vertical asymptote?

True or False: $(n + \log(n))(n+8)$ is $O(n)$

Asymptotic growth of $\sum_{k=1}^{n}\frac{\left(-1\right)^{k+1}\binom{n}{k}}{1-p^{k}}$ as $n \to \infty$

True or false: $n^2 + 2n^2 + 3n^2 + 4n^2 + ... n(n^2)$ is $O(n^2)$

Signs of Maclaurin coefficients of $\frac{1}{e^x+q}$

Solving a recurrence relation with floor function

Equations of asymptotic notations

Can we compute $X^n$ faster than $O(\log n)$?

Small-o asymptotic notation and inequality

How to prove that $O(n) \cdot O(n^2) = O(n^3)$?

Prove or disprove: If $O(\;f(n)\,O(g(n))\;)\in O(\;f(n)\,g(n)\;)$, then $O(\;f(n)\,g(n)\;) \in f(n)\,O(g(n))$

Asymptotically analyzing growth rate of matrix entries

Root-$n$ consistency of an estimator implies its variance is $O(n^{-1})$

Trending Questions

Popular # Hahtags

Popular Questions