Question

Closed-form term for this expression

score 53 · Answer 1 · 2026-03-29 17:23:02

53

Views

Closed-form term for this expression

Published on 29 Mar 2026 - 17:23

score 1.7k · Answer 2 · 2026-03-29 11:44:29

1.7k

Views

How do I prove that $a = n/2$ is a tight upper bound for the recurrence relation $T(n) = T(n-a) + T(a) + n$?

Published on 29 Mar 2026 - 11:44

score 33 · Answer 3 · 2026-03-29 09:11:20

33

Views

For which function $f$ is $1 \ll \sum_{i=1}^{n} i \cdot i^{-f(n)} \ll n$?

Published on 29 Mar 2026 - 9:11

score 138 · Answer 4 · 2014-08-18 13:18:15

138

Views

Incomplete Beta function $\text{B}_x(\alpha,\beta)$ approximation for large $\alpha,\beta$?

Published on 18 Aug 2014 - 13:18

score 45 · Answer 5 · 2026-03-27 23:28:10

45

Views

Approximate $_2F_1(a,b;c;x)$ for large (maybe negative) values of $a, b, c$?

Published on 27 Mar 2026 - 23:28

score 592 · Answer 6 · 2026-03-25 22:11:11

592

Views

How to show an aymptotic expansion is uniformly valid?

Published on 25 Mar 2026 - 22:11

score 76 · Answer 7 · 2014-08-18 23:27:12

76

Views

How would you show $\pi(x)\log(1-\frac{1}{x}) \sim \frac{1}{\log x}$

Published on 18 Aug 2014 - 23:27

score 36 · Answer 8 · 2014-08-19 00:15:53

36

Views

Show that $\int_{2}^x\frac{\pi(t)}{t(t-1)}dt=\log \log x+ O(1)$

Published on 19 Aug 2014 - 0:15

score 56 · Answer 9 · 2014-08-19 17:45:46

56

Views

Can I prove this, or hopeless? Deviating too much from mean

Published on 19 Aug 2014 - 17:45

score 53 · Answer 10 · 2014-08-20 08:08:30

53

Views

Asymptotic behaviour / Convergence

Published on 20 Aug 2014 - 8:08

score 2.7k · Answer 11 · 2026-03-25 17:36:30

2.7k

Views

What's time complexity of algorithm for "Word Break"?

Published on 25 Mar 2026 - 17:36

score 40 · Answer 12 · 2026-03-26 12:53:58

40

Views

Lower bound on $F$ under the assumption $\theta F(s)\le sF'(s)$

Published on 26 Mar 2026 - 12:53

score 283 · Answer 13 · 2014-08-23 15:13:10

283

Views

Asymptotics of logarithm: $\frac{1}{n}\ln(a+o(1)) = \frac{1}{n}\ln(a)+o(\frac{1}{n})$

Published on 23 Aug 2014 - 15:13

score 246 · Answer 14 · 2014-08-23 19:30:48

246

Views

How to rigorously simplify an expression with Big-Oh Composed within another Big-Oh.

Published on 23 Aug 2014 - 19:30

score 202 · Answer 15 · 2014-08-24 00:20:31

202

Views

Switching Limits and summation

Published on 24 Aug 2014 - 0:20

List Question

Closed-form term for this expression

How do I prove that $a = n/2$ is a tight upper bound for the recurrence relation $T(n) = T(n-a) + T(a) + n$?

For which function $f$ is $1 \ll \sum_{i=1}^{n} i \cdot i^{-f(n)} \ll n$?

Incomplete Beta function $\text{B}_x(\alpha,\beta)$ approximation for large $\alpha,\beta$?

Approximate $_2F_1(a,b;c;x)$ for large (maybe negative) values of $a, b, c$?

How to show an aymptotic expansion is uniformly valid?

How would you show $\pi(x)\log(1-\frac{1}{x}) \sim \frac{1}{\log x}$

Show that $\int_{2}^x\frac{\pi(t)}{t(t-1)}dt=\log \log x+ O(1)$

Can I prove this, or hopeless? Deviating too much from mean

Asymptotic behaviour / Convergence

What's time complexity of algorithm for "Word Break"?

Lower bound on $F$ under the assumption $\theta F(s)\le sF'(s)$

Asymptotics of logarithm: $\frac{1}{n}\ln(a+o(1)) = \frac{1}{n}\ln(a)+o(\frac{1}{n})$

How to rigorously simplify an expression with Big-Oh Composed within another Big-Oh.

Switching Limits and summation

Trending Questions

Popular # Hahtags

Popular Questions