Question

Which mathematic skills are necessary to understand big-o notation on a basic level?

score 641 · Answer 1 · 2018-03-26 03:52:45

641

Views

Which mathematic skills are necessary to understand big-o notation on a basic level?

Published on 26 Mar 2018 - 3:52

score 155 · Answer 2 · 2018-03-26 05:07:49

155

Views

Estimate $\left(\begin{array}{c}n\\ k\end{array}\right)\left(1-2^{-k}\right)^{n-k}<1$.

Published on 26 Mar 2018 - 5:07

score 236 · Answer 3 · 2018-03-27 12:59:58

236

Views

Asymptotics of an integral by two methods

Published on 27 Mar 2018 - 12:59

score 338 · Answer 4 · 2018-03-28 14:06:04

338

Views

prove that $\log( f(n) )=o(\log(g(n)))$ implies $f(n)=o(g(n))$ (small o)

Published on 28 Mar 2018 - 14:06

score 593 · Answer 5 · 2026-03-24 23:45:06

593

Views

Use the method of "changing variables" to solve the following recurrence:

Published on 24 Mar 2026 - 23:45

score 140 · Answer 6 · 2026-03-24 01:47:12

140

Views

Finding the appropriate law of large numbers

Published on 24 Mar 2026 - 1:47

score 61 · Answer 7 · 2018-03-28 20:23:19

61

Views

Calculate big O notation n!

Published on 28 Mar 2018 - 20:23

score 1.5k · Answer 8 · 2018-03-30 12:29:42

1.5k

Views

$T(n) = nT(n-1) + 1$ with $T(1)=1$

Published on 30 Mar 2018 - 12:29

score 144 · Answer 9 · 2018-03-30 14:31:24

144

Views

Rigorous proof of Taylor expansion for matrix square root

Published on 30 Mar 2018 - 14:31

score 140 · Answer 10 · 2018-03-30 16:49:39

140

Views

Solve recurrence $T(n) = T(\frac34n) + \sqrt n$

Published on 30 Mar 2018 - 16:49

score 240 · Answer 11 · 2026-03-19 13:49:57

240

Views

Eulerian Number Asymptotics

Published on 19 Mar 2026 - 13:49

score 180 · Answer 12 · 2018-03-30 22:26:23

180

Views

The notation $f < o(g)$ and $f > o(g)$ from the Landau family of asymptotic notations

Published on 30 Mar 2018 - 22:26

score 131 · Answer 13 · 2026-03-25 14:25:18

131

Views

The relation of $O$- and $\Omega$-symbols and an unexpected absolute sign in the definiton of $O$.

Published on 25 Mar 2026 - 14:25

score 743 · Answer 14 · 2026-03-24 23:57:28

743

Views

Using the Saddle point method (or Laplace method) for a multiple integral over a large number of variables

Published on 24 Mar 2026 - 23:57

score 44 · Answer 15 · 2018-03-31 20:13:02

44

Views

Asymptotics claims (little o and exponentiation)

Published on 31 Mar 2018 - 20:13

List Question

Which mathematic skills are necessary to understand big-o notation on a basic level?

Estimate $\left(\begin{array}{c}n\\ k\end{array}\right)\left(1-2^{-k}\right)^{n-k}<1$.

Asymptotics of an integral by two methods

prove that $\log( f(n) )=o(\log(g(n)))$ implies $f(n)=o(g(n))$ (small o)

Use the method of "changing variables" to solve the following recurrence:

Finding the appropriate law of large numbers

Calculate big O notation n!

$T(n) = nT(n-1) + 1$ with $T(1)=1$

Rigorous proof of Taylor expansion for matrix square root

Solve recurrence $T(n) = T(\frac34n) + \sqrt n$

Eulerian Number Asymptotics

The notation $f < o(g)$ and $f > o(g)$ from the Landau family of asymptotic notations

The relation of $O$- and $\Omega$-symbols and an unexpected absolute sign in the definiton of $O$.

Using the Saddle point method (or Laplace method) for a multiple integral over a large number of variables

Asymptotics claims (little o and exponentiation)

Trending Questions

Popular # Hahtags

Popular Questions