Question

Can you solve this recurrence relation?

score 68 · Answer 1 · 2019-09-14 17:46:50

68

Views

Can you solve this recurrence relation?

Published on 14 Sep 2019 - 17:46

score 47 · Answer 2 · 2019-09-14 20:24:22

47

Views

Solving the recurrence: $T(n)=9T(n^{1/6})+\log^2(n)$

Published on 14 Sep 2019 - 20:24

score 144 · Answer 3 · 2019-09-15 08:06:41

144

Views

Recursive definition of predecessor vertices in a graph

Published on 15 Sep 2019 - 8:06

score 263 · Answer 4 · 2026-03-25 03:02:36

263

Views

What is some easy illustrative example of an non-recursive formal system and recursive formal system?

Published on 25 Mar 2026 - 3:02

score 39 · Answer 5 · 2019-09-17 23:56:16

39

Views

Solve the recursion

Published on 17 Sep 2019 - 23:56

score 330 · Answer 6 · 2019-09-18 14:52:25

330

Views

Solving recurrence relation of two series with generating functions

Published on 18 Sep 2019 - 14:52

score 258 · Answer 7 · 2026-03-26 06:15:25

258

Views

Is this theory a conservative extension of peano arithmetic?

Published on 26 Mar 2026 - 6:15

score 49 · Answer 8 · 2026-03-26 04:31:13

49

Views

Is this theory of recursive counting equi-interpretable with PA?

Published on 26 Mar 2026 - 4:31

score 607 · Answer 9 · 2026-03-25 19:17:43

607

Views

Continued fractions using recursion relations

Published on 25 Mar 2026 - 19:17

score 70 · Answer 10 · 2019-09-21 18:27:32

70

Views

Why is the plot of these two seemingly different functions come out the same? ( Result of solving recurrence $\ T(n) = nT(n/2)^2 $ )

Published on 21 Sep 2019 - 18:27

score 83 · Answer 11 · 2026-03-25 06:08:30

83

Views

Substitution scheme in Ammann–Beenker tiling

Published on 25 Mar 2026 - 6:08

score 36 · Answer 12 · 2019-09-24 08:51:21

36

Views

intuition as to why $c \notin ran f$ for theorem implying $h$ is one-to-one when $f$ is one-to-one

Published on 24 Sep 2019 - 8:51

score 317 · Answer 13 · 2026-03-27 00:56:24

317

Views

Recursively enumerable set is an image of primitive recursive function

Published on 27 Mar 2026 - 0:56

score 34 · Answer 14 · 2019-09-25 03:57:59

34

Views

Proving that if the odd and even sequences converge, where one is decreasing and the other is increasing, then they converge to the same limit

Published on 25 Sep 2019 - 3:57

score 257 · Answer 15 · 2026-03-18 08:48:57

257

Views

$35.2850899... $ has a closed form ??

Published on 18 Mar 2026 - 8:48

List Question

Can you solve this recurrence relation?

Solving the recurrence: $T(n)=9T(n^{1/6})+\log^2(n)$

Recursive definition of predecessor vertices in a graph

What is some easy illustrative example of an non-recursive formal system and recursive formal system?

Solve the recursion

Solving recurrence relation of two series with generating functions

Is this theory a conservative extension of peano arithmetic?

Is this theory of recursive counting equi-interpretable with PA?

Continued fractions using recursion relations

Why is the plot of these two seemingly different functions come out the same? ( Result of solving recurrence $\ T(n) = nT(n/2)^2 $ )

Substitution scheme in Ammann–Beenker tiling

intuition as to why $c \notin ran f$ for theorem implying $h$ is one-to-one when $f$ is one-to-one

Recursively enumerable set is an image of primitive recursive function

Proving that if the odd and even sequences converge, where one is decreasing and the other is increasing, then they converge to the same limit

$35.2850899... $ has a closed form ??

Trending Questions

Popular # Hahtags

Popular Questions