Question

If $f(x) = x(1 - x^n)^{-1/n}$, how many function compositions does it take for $f(f(f(\cdots f(x_0)))) > 1$?

score 41 · Answer 1 · 2019-10-29 00:51:47

41

Views

If $f(x) = x(1 - x^n)^{-1/n}$, how many function compositions does it take for $f(f(f(\cdots f(x_0)))) > 1$?

Published on 29 Oct 2019 - 0:51

score 71 · Answer 2 · 2019-10-29 07:15:06

71

Views

How to find the asymptotic distribution of $Y_{n} X_{n}$

Published on 29 Oct 2019 - 7:15

score 25 · Answer 3 · 2026-03-26 20:06:53

25

Views

Error Analysis for a Fraction

Published on 26 Mar 2026 - 20:06

score 42 · Answer 4 · 2026-03-25 06:58:55

42

Views

Big O Subtraction: $g(x) = f(x) + O(x) \rightarrow f(x) = g(x) + O(x)$

Published on 25 Mar 2026 - 6:58

score 2.6k · Answer 5 · 2019-10-30 12:11:25

2.6k

Views

Asymptotic behavior of polynomials

Published on 30 Oct 2019 - 12:11

score 172 · Answer 6 · 2026-03-31 19:11:38

172

Views

Confusion about big O notation in approximation to zeta function

Published on 31 Mar 2026 - 19:11

score 29 · Answer 7 · 2019-10-31 23:54:39

29

Views

Liapunov and probaility convergence proof

Published on 31 Oct 2019 - 23:54

score 104 · Answer 8 · 2019-11-01 00:46:45

104

Views

Is it true that primes of the form $5 + 6k$ exceed primes of the form $7 + 6k$ as $k \rightarrow \infty$?

Published on 01 Nov 2019 - 0:46

score 62 · Answer 9 · 2019-11-01 05:15:23

62

Views

Prove the theorem

Published on 01 Nov 2019 - 5:15

score 353 · Answer 10 · 2026-03-30 15:36:19

353

Views

Number of factors of $2^{p_1\cdots p_n}+1$

Published on 30 Mar 2026 - 15:36

score 65 · Answer 11 · 2026-03-30 15:34:50

65

Views

Derive a formula for $m$, if possible in $2n> \log{(n^{10} m)}^{m}$

Published on 30 Mar 2026 - 15:34

score 1.3k · Answer 12 · 2019-11-02 13:04:42

1.3k

Views

$\sqrt{\log n}$ vs $\log\sqrt{n}$

Published on 02 Nov 2019 - 13:04

score 72 · Answer 13 · 2026-03-27 07:47:49

72

Views

Master theorem application

Published on 27 Mar 2026 - 7:47

score 72 · Answer 14 · 2026-04-06 12:59:26

72

Views

Proving the recurrence $T(n) = T(n-2) + 2\log(n)$ is $\Theta(n*\log n))$

Published on 06 Apr 2026 - 12:59

score 712 · Answer 15 · 2019-11-03 05:28:15

712

Views

$X_n$ is bounded in probability and $Y_n$ converges to 0 in probability then $X_nY_n$ congerges to probablity with 0

Published on 03 Nov 2019 - 5:28

List Question

If $f(x) = x(1 - x^n)^{-1/n}$, how many function compositions does it take for $f(f(f(\cdots f(x_0)))) > 1$?

How to find the asymptotic distribution of $Y_{n} X_{n}$

Error Analysis for a Fraction

Big O Subtraction: $g(x) = f(x) + O(x) \rightarrow f(x) = g(x) + O(x)$

Asymptotic behavior of polynomials

Confusion about big O notation in approximation to zeta function

Liapunov and probaility convergence proof

Is it true that primes of the form $5 + 6k$ exceed primes of the form $7 + 6k$ as $k \rightarrow \infty$?

Prove the theorem

Number of factors of $2^{p_1\cdots p_n}+1$

Derive a formula for $m$, if possible in $2n> \log{(n^{10} m)}^{m}$

$\sqrt{\log n}$ vs $\log\sqrt{n}$

Master theorem application

Proving the recurrence $T(n) = T(n-2) + 2\log(n)$ is $\Theta(n*\log n))$

$X_n$ is bounded in probability and $Y_n$ converges to 0 in probability then $X_nY_n$ congerges to probablity with 0

Trending Questions

Popular # Hahtags

Popular Questions