Question

If $f(x) \in O(x^2)$, then $f(x) \in O(x^k)$ for all $k>2$, right?

score 45 · Answer 1 · 2019-09-17 14:52:17

45

Views

If $f(x) \in O(x^2)$, then $f(x) \in O(x^k)$ for all $k>2$, right?

Published on 17 Sep 2019 - 14:52

score 95 · Answer 2 · 2026-03-25 19:05:24

95

Views

Books that provide justifications of perturbations and asymptotic methods.

Published on 25 Mar 2026 - 19:05

score 27 · Answer 3 · 2019-09-18 15:08:05

27

Views

What is a Big-O of a little-o function?

Published on 18 Sep 2019 - 15:08

score 63 · Answer 4 · 2019-09-18 17:39:59

63

Views

Eliminating logs in Big-Oh proofs

Published on 18 Sep 2019 - 17:39

score 68 · Answer 5 · 2026-03-28 03:03:03

68

Views

Find argmax $\frac{1}{2b}(\frac{x}{Na})^{\frac{N-1}{2}}e^{-\frac{1}{2b}(x+Na)}\frac{1}{\sqrt{2\pi(N-1)}}(\frac{\frac{e}{b}\sqrt{Nax}}{2(N-1)})^{N-1}$

Published on 28 Mar 2026 - 3:03

score 108 · Answer 6 · 2026-03-28 08:47:52

108

Views

Cost analysis for implementing a stack as an array?

Published on 28 Mar 2026 - 8:47

score 678 · Answer 7 · 2019-09-19 12:21:26

678

Views

Trying to find $c_{1}$ , $c_{2}$ for Big theta notation.

Published on 19 Sep 2019 - 12:21

score 111 · Answer 8 · 2026-04-03 04:15:49

111

Views

Time complexity plotting of binary search LOG base problem.

Published on 03 Apr 2026 - 4:15

score 62 · Answer 9 · 2026-03-30 07:07:49

62

Views

Can the limit definition of Big O equal $0$?

Published on 30 Mar 2026 - 7:07

score 712 · Answer 10 · 2026-03-26 04:53:34

712

Views

Analysis of longest run of heads when flipping a fair coin.

Published on 26 Mar 2026 - 4:53

score 61 · Answer 11 · 2019-09-21 17:20:20

61

Views

$a_n=O(\frac{1}{n}),\ \frac{\sum_{k=1}^nS_k}{n}$ converges $\Rightarrow S_n$ converges

Published on 21 Sep 2019 - 17:20

score 397 · Answer 12 · 2019-09-22 01:15:00

397

Views

What is the relative time complexity for f(n) = loglog(n), g(n) = log(n)

Published on 22 Sep 2019 - 1:15

score 952 · Answer 13 · 2026-03-29 16:49:13

952

Views

How many numbers $n$ are there such that $\gcd(n,\phi(n)) = 1$?

Published on 29 Mar 2026 - 16:49

score 126 · Answer 14 · 2019-09-22 15:23:34

126

Views

Number of distinct prime divisors asymptotic

Published on 22 Sep 2019 - 15:23

score 19 · Answer 15 · 2019-09-23 16:24:30

19

Views

Prove an equivalence of asymptotic formulas

Published on 23 Sep 2019 - 16:24

List Question

If $f(x) \in O(x^2)$, then $f(x) \in O(x^k)$ for all $k>2$, right?

Books that provide justifications of perturbations and asymptotic methods.

What is a Big-O of a little-o function?

Eliminating logs in Big-Oh proofs

Find argmax $\frac{1}{2b}(\frac{x}{Na})^{\frac{N-1}{2}}e^{-\frac{1}{2b}(x+Na)}\frac{1}{\sqrt{2\pi(N-1)}}(\frac{\frac{e}{b}\sqrt{Nax}}{2(N-1)})^{N-1}$

Cost analysis for implementing a stack as an array?

Trying to find $c_{1}$ , $c_{2}$ for Big theta notation.

Time complexity plotting of binary search LOG base problem.

Can the limit definition of Big O equal $0$?

Analysis of longest run of heads when flipping a fair coin.

$a_n=O(\frac{1}{n}),\ \frac{\sum_{k=1}^nS_k}{n}$ converges $\Rightarrow S_n$ converges

What is the relative time complexity for f(n) = loglog(n), g(n) = log(n)

How many numbers $n$ are there such that $\gcd(n,\phi(n)) = 1$?

Number of distinct prime divisors asymptotic

Prove an equivalence of asymptotic formulas

Trending Questions

Popular # Hahtags

Popular Questions