Question

Recurrence relation $T(n) = T(n-1)+\frac 1n$

score 77 · Answer 1 · 2018-04-30 11:35:17

77

Views

Recurrence relation $T(n) = T(n-1)+\frac 1n$

Published on 30 Apr 2018 - 11:35

score 238 · Answer 2 · 2018-04-30 17:13:47

238

Views

Does a recursive function with infinite domain and a finite range have to be periodic?

Published on 30 Apr 2018 - 17:13

score 316 · Answer 3 · 2018-05-02 07:01:20

316

Views

How to classify recurrence equations?

Published on 02 May 2018 - 7:01

score 337 · Answer 4 · 2018-05-03 15:34:03

337

Views

Solving a recursive formula $a_0=2, a_n=n+\sum_{i=2}^{n-1}a_i$ (Thabit numbers)

Published on 03 May 2018 - 15:34

score 77 · Answer 5 · 2018-05-03 23:19:52

77

Views

What is the behavior of this family of iterative sequences?

Published on 03 May 2018 - 23:19

score 62 · Answer 6 · 2018-05-04 01:50:15

62

Views

Closed form estimation for f(n) in the recursive formula $f(x+1)=f(x)+{1 \over f(x)}$

Published on 04 May 2018 - 1:50

score 75 · Answer 7 · 2018-05-06 23:02:00

75

Views

How do I recursively sum digits of a number until I'm left with only one digit using mathematical expression?

Published on 06 May 2018 - 23:02

score 67 · Answer 8 · 2018-05-09 21:33:48

67

Views

Induction and Recursion: $F(1) = 2$ and $F(n) = F(n - 1) + F(n - 2) + \dotsb + F(1) + 2$, $n \ge 2$

Published on 09 May 2018 - 21:33

score 1.2k · Answer 9 · 2018-05-11 16:34:32

1.2k

Views

Show that $f(x) = \lfloor \sqrt{2} \cdot x\rfloor$ is primitive recursive function.

Published on 11 May 2018 - 16:34

score 119 · Answer 10 · 2018-05-11 17:12:34

119

Views

Recursion: $f(n+1)=-2f(n)$

Published on 11 May 2018 - 17:12

score 167 · Answer 11 · 2018-05-12 16:59:02

167

Views

Given the function $f (n) = 1 + (-1)^n$ for $n ≥ 1$

Published on 12 May 2018 - 16:59

score 562 · Answer 12 · 2018-05-13 04:41:03

562

Views

Proof of a proposition about recursion definition (Terence Tao's Analysis I)

Published on 13 May 2018 - 4:41

score 218 · Answer 13 · 2018-05-16 20:21:11

218

Views

How to find the divergence rate of a recursive sequence defined by $s_n = s_{n-1}(1 + c_n s_{n-1})$

Published on 16 May 2018 - 20:21

score 609 · Answer 14 · 2018-05-19 09:50:42

609

Views

Convergence of Newton's method for polynomials

Published on 19 May 2018 - 9:50

score 221 · Answer 15 · 2026-03-17 17:01:49

221

Views

Definition of (lazy) conditional in partial recursive functions

Published on 17 Mar 2026 - 17:01

List Question

Recurrence relation $T(n) = T(n-1)+\frac 1n$

Does a recursive function with infinite domain and a finite range have to be periodic?

How to classify recurrence equations?

Solving a recursive formula $a_0=2, a_n=n+\sum_{i=2}^{n-1}a_i$ (Thabit numbers)

What is the behavior of this family of iterative sequences?

Closed form estimation for f(n) in the recursive formula $f(x+1)=f(x)+{1 \over f(x)}$

How do I recursively sum digits of a number until I'm left with only one digit using mathematical expression?

Induction and Recursion: $F(1) = 2$ and $F(n) = F(n - 1) + F(n - 2) + \dotsb + F(1) + 2$, $n \ge 2$

Show that $f(x) = \lfloor \sqrt{2} \cdot x\rfloor$ is primitive recursive function.

Recursion: $f(n+1)=-2f(n)$

Given the function $f (n) = 1 + (-1)^n$ for $n ≥ 1$

Proof of a proposition about recursion definition (Terence Tao's Analysis I)

How to find the divergence rate of a recursive sequence defined by $s_n = s_{n-1}(1 + c_n s_{n-1})$

Convergence of Newton's method for polynomials

Definition of (lazy) conditional in partial recursive functions

Trending Questions

Popular # Hahtags

Popular Questions