Question

Recursion $y_n = ky_{n-1}+ry_{n-2}, y_0 = 2, y_1 = k$ and Fermat Theorem

score 137 · Answer 1 · 2017-12-02 18:08:47

137

Views

Recursion $y_n = ky_{n-1}+ry_{n-2}, y_0 = 2, y_1 = k$ and Fermat Theorem

Published on 02 Dec 2017 - 18:08

score 421 · Answer 2 · 2017-12-02 19:09:48

421

Views

Proving that a recursively defined sequence converges, Newton's method

Published on 02 Dec 2017 - 19:09

score 49 · Answer 3 · 2017-12-02 22:29:29

49

Views

Let $L_1 = 1, L_2 = 3$ and $L_{n+1} = L_n + L_{n−1}$ for $n ≥ 3$. Prove by induction ...

Published on 02 Dec 2017 - 22:29

score 62 · Answer 4 · 2026-03-31 04:09:28

62

Views

Non linear recursion of the form $a_{n+1} \leq b_{n} \cdot a_{n} + c_{n}$

Published on 31 Mar 2026 - 4:09

score 400 · Answer 5 · 2026-03-29 16:24:35

400

Views

Prime Foias constant

Published on 29 Mar 2026 - 16:24

score 216 · Answer 6 · 2026-03-26 03:01:48

216

Views

Variant on a Large-Scale Monty Hall Problem

Published on 26 Mar 2026 - 3:01

score 476 · Answer 7 · 2026-04-03 20:56:04

476

Views

Growth rate of the nth natural number not constructable with n steps of addition and multiplication

Published on 03 Apr 2026 - 20:56

score 66 · Answer 8 · 2017-12-09 08:54:57

66

Views

Runtime of random recursive program

Published on 09 Dec 2017 - 8:54

score 83 · Answer 9 · 2026-03-29 03:03:46

83

Views

Finding the limit of a recursive sequence using a differential equation

Published on 29 Mar 2026 - 3:03

score 54 · Answer 10 · 2017-12-14 00:29:01

54

Views

I cant prove this. i dont understand what will be my hypothesis for induction.

Published on 14 Dec 2017 - 0:29

score 101 · Answer 11 · 2017-12-14 10:49:35

101

Views

Find a solution for the equation $a(4n) = {a(n)\over 4}$

Published on 14 Dec 2017 - 10:49

score 78 · Answer 12 · 2026-04-04 04:39:22

78

Views

Is it possible to know what to multiply with a binary number so the answer contains a string of 1's?

Published on 04 Apr 2026 - 4:39

score 832 · Answer 13 · 2017-12-17 19:51:23

832

Views

Recursion and First-Order-Logic

Published on 17 Dec 2017 - 19:51

score 82 · Answer 14 · 2017-12-31 14:20:57

82

Views

Let Sn be the set of all natural numbers in the decimal system consisting of n digits such that no successive digits of this number is zero.

Published on 31 Dec 2017 - 14:20

score 248 · Answer 15 · 2018-01-02 18:13:31

248

Views

Sum over finite sets is well-defined

Published on 02 Jan 2018 - 18:13

List Question

Recursion $y_n = ky_{n-1}+ry_{n-2}, y_0 = 2, y_1 = k$ and Fermat Theorem

Proving that a recursively defined sequence converges, Newton's method

Let $L_1 = 1, L_2 = 3$ and $L_{n+1} = L_n + L_{n−1}$ for $n ≥ 3$. Prove by induction ...

Non linear recursion of the form $a_{n+1} \leq b_{n} \cdot a_{n} + c_{n}$

Prime Foias constant

Variant on a Large-Scale Monty Hall Problem

Growth rate of the nth natural number not constructable with n steps of addition and multiplication

Runtime of random recursive program

Finding the limit of a recursive sequence using a differential equation

I cant prove this. i dont understand what will be my hypothesis for induction.

Find a solution for the equation $a(4n) = {a(n)\over 4}$

Is it possible to know what to multiply with a binary number so the answer contains a string of 1's?

Recursion and First-Order-Logic

Let Sn be the set of all natural numbers in the decimal system consisting of n digits such that no successive digits of this number is zero.

Sum over finite sets is well-defined

Trending Questions

Popular # Hahtags

Popular Questions