Question

Functional equation: Show $0\le f(n+1)-f(n)\le 1$ and find all $n$ such that $f(n)=1025$.

score 145 · Answer 1 · 2026-04-15 01:43:06

145

Views

Functional equation: Show $0\le f(n+1)-f(n)\le 1$ and find all $n$ such that $f(n)=1025$.

Published on 15 Apr 2026 - 1:43

score 5.6k · Answer 2 · 2026-04-16 06:17:52

5.6k

Views

Use induction to prove the following equation: $2 + 6 + 10 + \cdots + (4n − 2) = 2n^2$ where $n \ge 1$

Published on 16 Apr 2026 - 6:17

score 131 · Answer 3 · 2026-04-13 03:13:34

131

Views

Proof that expression is integer, $\frac{(3n)!}{6^nn!}$

Published on 13 Apr 2026 - 3:13

score 159 · Answer 4 · 2026-04-16 14:22:00

159

Views

Proof that expression is integer, $\frac{(2n)!}{n!(n+1)!}$

Published on 16 Apr 2026 - 14:22

score 167 · Answer 5 · 2026-04-11 21:15:46

167

Views

Trying to correctly write the proof using strong induction of the sum of the nth positive integer

Published on 11 Apr 2026 - 21:15

score 41 · Answer 6 · 2026-04-10 17:12:35

41

Views

Help with induction question

Published on 10 Apr 2026 - 17:12

score 424 · Answer 7 · 2026-04-09 15:16:04

424

Views

Proof by induction for "sum-of"

Published on 09 Apr 2026 - 15:16

score 52 · Answer 8 · 2026-04-14 06:30:00

52

Views

Theory of Computation Notation Proof

Published on 14 Apr 2026 - 6:30

score 230 · Answer 9 · 2026-04-10 22:42:08

230

Views

Prove the following using induction on d (matrices)

Published on 10 Apr 2026 - 22:42

score 133 · Answer 10 · 2026-04-13 18:10:02

133

Views

Induction proof.

Published on 13 Apr 2026 - 18:10

score 1.8k · Answer 11 · 2026-05-04 09:02:09

1.8k

Views

Fibonacci identity: $f_{n+1}f_{n-1} = f_n^2 + (-1)^n$

Published on 04 May 2026 - 9:02

score 233 · Answer 12 · 2026-04-16 01:20:40

233

Views

Bernoullis inequality proof

Published on 16 Apr 2026 - 1:20

score 44 · Answer 13 · 2026-05-04 08:46:41

44

Views

How did the solution to this system of equations get a power of n?

Published on 04 May 2026 - 8:46

score 964 · Answer 14 · 2026-05-05 10:03:12

964

Views

Show that $\sum_{i=1}^{n}[\log_{2}(n/i)]$ is O(n), hint use Stirling's Approximation

Published on 05 May 2026 - 10:03

score 203 · Answer 15 · 2026-04-16 07:19:04

203

Views

100-level discrete maths, induction problem, prove $n^2 \ge 2n + 1$

Published on 16 Apr 2026 - 7:19

List Question

Functional equation: Show $0\le f(n+1)-f(n)\le 1$ and find all $n$ such that $f(n)=1025$.

Use induction to prove the following equation: $2 + 6 + 10 + \cdots + (4n − 2) = 2n^2$ where $n \ge 1$

Proof that expression is integer, $\frac{(3n)!}{6^nn!}$

Proof that expression is integer, $\frac{(2n)!}{n!(n+1)!}$

Trying to correctly write the proof using strong induction of the sum of the nth positive integer

Help with induction question

Proof by induction for "sum-of"

Theory of Computation Notation Proof

Prove the following using induction on d (matrices)

Induction proof.

Fibonacci identity: $f_{n+1}f_{n-1} = f_n^2 + (-1)^n$

Bernoullis inequality proof

How did the solution to this system of equations get a power of n?

Show that $\sum_{i=1}^{n}[\log_{2}(n/i)]$ is O(n), hint use Stirling's Approximation

100-level discrete maths, induction problem, prove $n^2 \ge 2n + 1$

Trending Questions

Popular # Hahtags

Popular Questions