Question

Fibonacci Proof Using Induction

score 181 · Answer 1 · 2026-03-27 00:54:57

181

Views

Fibonacci Proof Using Induction

Published on 27 Mar 2026 - 0:54

score 126 · Answer 2 · 2026-03-27 00:54:48

126

Views

Fibonacci Proof with Induction

Published on 27 Mar 2026 - 0:54

score 177 · Answer 3 · 2026-04-02 11:33:52

177

Views

Inductive Proof Recursive Definition

Published on 02 Apr 2026 - 11:33

score 2.5k · Answer 4 · 2026-03-27 00:57:02

2.5k

Views

Help with induction proof for formula connecting Pascal's Triangle with Fibonacci Numbers

Published on 27 Mar 2026 - 0:57

score 48 · Answer 5 · 2026-03-29 15:15:21

48

Views

$a^{(m+n)}_{ij} \geq a^{(m)}_{ik}a^{(n)}_{kl}$ for non-negative Matrix $A$

Published on 29 Mar 2026 - 15:15

score 60 · Answer 6 · 2014-03-31 19:58:42

60

Views

Induction question help.

Published on 31 Mar 2014 - 19:58

score 235 · Answer 7 · 2014-03-31 21:45:54

235

Views

Inductive proof and summation: $\sum\limits_{i=1}^n i^3 = \frac{n^2(n+1)^2}{4}$

Published on 31 Mar 2014 - 21:45

score 3.4k · Answer 8 · 2014-04-01 01:43:43

3.4k

Views

Mathematical induction proof that $8$ divides $3^{2n} - 1$

Published on 01 Apr 2014 - 1:43

score 56 · Answer 9 · 2014-04-01 01:47:43

56

Views

Binomial Coefficient Recusions

Published on 01 Apr 2014 - 1:47

score 47.8k · Answer 10 · 2014-04-01 07:35:47

47.8k

Views

proof by induction: sum of binomial coefficients $\sum_{k=0}^n (^n_k) = 2^n$

Published on 01 Apr 2014 - 7:35

score 52 · Answer 11 · 2026-03-25 06:32:03

52

Views

Proofs for $g(x)=e^{-1/x^2}$ when $x\neq0$, and $g(x)=0$ when $x=0$

Published on 25 Mar 2026 - 6:32

score 151 · Answer 12 · 2014-04-02 00:27:17

151

Views

Prove by induction $1 + \frac{1}{2} + \frac{1}{2} + \frac{1}{3} + \ldots + \frac{1}{2^n} \ge 1 + \frac {n}{2}$

Published on 02 Apr 2014 - 0:27

score 163 · Answer 13 · 2014-04-02 01:54:26

Let $A_1, A_2, \ldots, A_n$ be sets (where $n \ge 2$). Suppose for any two sets $A_i$ and $A_j$ either $A_i \subseteq A_j$ or $A_j \subseteq A_i$

score 3.6k · Answer 14 · 2026-03-30 03:23:35

3.6k

Views

My first proof that uses the well-ordering principle (very simple number theory). Please mark/grade.

Published on 30 Mar 2026 - 3:23

score 134 · Answer 15 · 2014-04-03 14:36:56

134

Views

$lcm(a_{1},...,a_{n})=lcm(lcm(a_{1},...,a_{n-1}),a_{n})$

Published on 03 Apr 2014 - 14:36

List Question

Fibonacci Proof Using Induction

Fibonacci Proof with Induction

Inductive Proof Recursive Definition

Help with induction proof for formula connecting Pascal's Triangle with Fibonacci Numbers

$a^{(m+n)}_{ij} \geq a^{(m)}_{ik}a^{(n)}_{kl}$ for non-negative Matrix $A$

Induction question help.

Inductive proof and summation: $\sum\limits_{i=1}^n i^3 = \frac{n^2(n+1)^2}{4}$

Mathematical induction proof that $8$ divides $3^{2n} - 1$

Binomial Coefficient Recusions

proof by induction: sum of binomial coefficients $\sum_{k=0}^n (^n_k) = 2^n$

Proofs for $g(x)=e^{-1/x^2}$ when $x\neq0$, and $g(x)=0$ when $x=0$

Prove by induction $1 + \frac{1}{2} + \frac{1}{2} + \frac{1}{3} + \ldots + \frac{1}{2^n} \ge 1 + \frac {n}{2}$

Let $A_1, A_2, \ldots, A_n$ be sets (where $n \ge 2$). Suppose for any two sets $A_i$ and $A_j$ either $A_i \subseteq A_j$ or $A_j \subseteq A_i$

My first proof that uses the well-ordering principle (very simple number theory). Please mark/grade.

$lcm(a_{1},...,a_{n})=lcm(lcm(a_{1},...,a_{n-1}),a_{n})$

Trending Questions

Popular # Hahtags

Popular Questions