Question

Having trouble with a recurrence relation of $2$ variables

score 94 · Answer 1 · 2017-05-01 07:02:04

94

Views

Having trouble with a recurrence relation of $2$ variables

Published on 01 May 2017 - 7:02

score 285 · Answer 2 · 2026-04-02 23:16:06

285

Views

Nested ceiling simplification

Published on 02 Apr 2026 - 23:16

score 590 · Answer 3 · 2017-05-02 20:29:05

590

Views

Condensing a sum into simpler notation

Published on 02 May 2017 - 20:29

score 36 · Answer 4 · 2017-05-04 15:05:44

36

Views

How would one describe this function?

Published on 04 May 2017 - 15:05

score 61 · Answer 5 · 2017-05-05 12:55:40

61

Views

How will you solve the following recurrence equation?

Published on 05 May 2017 - 12:55

score 135 · Answer 6 · 2017-05-07 12:02:06

135

Views

Closed form of a recursive equation

Published on 07 May 2017 - 12:02

score 174 · Answer 7 · 2017-05-09 23:09:49

174

Views

Build a recursive function for the number of ways to place n tiles of colors grey, black, green or red if no 3 red tiles occur consecutively.

Published on 09 May 2017 - 23:09

score 2.4k · Answer 8 · 2026-03-30 14:40:21

2.4k

Views

Solve the recurrence $T(n) = 2T(n-1) + 2n - 1$

Published on 30 Mar 2026 - 14:40

score 270 · Answer 9 · 2017-05-16 09:03:14

270

Views

Can I apply master theorem to this problem?

Published on 16 May 2017 - 9:03

score 3.2k · Answer 10 · 2026-04-03 03:21:48

3.2k

Views

Prove every inﬁnite recursively enumerable subset of $\Bbb N$ contains an inﬁnite recursive subset

Published on 03 Apr 2026 - 3:21

score 239 · Answer 11 · 2026-03-25 18:58:41

239

Views

How does one make a large number using computable methods?

Published on 25 Mar 2026 - 18:58

score 30 · Answer 12 · 2017-05-16 22:25:29

30

Views

Writing first $5$ terms of recurrence relation

Published on 16 May 2017 - 22:25

score 739 · Answer 13 · 2026-04-03 04:58:18

739

Views

(Proof verification)An inﬁnite subset of $\Bbb N$ is recursive if and only if it is the range of a strictly increasing recursive function.

Published on 03 Apr 2026 - 4:58

score 156 · Answer 14 · 2017-05-18 19:08:58

156

Views

Iteration of $x_{n+1} = \tan (e^{x_n})$

Published on 18 May 2017 - 19:08

score 575 · Answer 15 · 2026-03-31 05:59:32

575

Views

Characteristic function of a the range of a strictly increasing function.

Published on 31 Mar 2026 - 5:59

List Question

Having trouble with a recurrence relation of $2$ variables

Nested ceiling simplification

Condensing a sum into simpler notation

How would one describe this function?

How will you solve the following recurrence equation?

Closed form of a recursive equation

Build a recursive function for the number of ways to place n tiles of colors grey, black, green or red if no 3 red tiles occur consecutively.

Solve the recurrence $T(n) = 2T(n-1) + 2n - 1$

Can I apply master theorem to this problem?

Prove every inﬁnite recursively enumerable subset of $\Bbb N$ contains an inﬁnite recursive subset

How does one make a large number using computable methods?

Writing first $5$ terms of recurrence relation

(Proof verification)An inﬁnite subset of $\Bbb N$ is recursive if and only if it is the range of a strictly increasing recursive function.

Iteration of $x_{n+1} = \tan (e^{x_n})$

Characteristic function of a the range of a strictly increasing function.

Trending Questions

Popular # Hahtags

Popular Questions