Question

how to prove recursive function f(x) is in O(n)?

score 84 · Answer 1 · 2026-04-10 19:49:22

84

Views

how to prove recursive function f(x) is in O(n)?

Published on 10 Apr 2026 - 19:49

score 88 · Answer 2 · 2020-07-16 07:13:59

88

Views

Prove $n+\left(-1\right)^n\ge \frac{n}{2}$ is true for $n\ge 2$ using induction

Published on 16 Jul 2020 - 7:13

score 106 · Answer 3 · 2020-07-16 08:19:50

106

Views

Prove that $\frac{1}{1^2} + \frac{1}{2^2} + \cdots + \frac{1}{n^2} > \frac{3n}{2n+1}$ for all $n \geq 2$ by induction

Published on 16 Jul 2020 - 8:19

score 51 · Answer 4 · 2026-04-11 17:32:40

51

Views

Proof appears to use substitution inconsistently.

Published on 11 Apr 2026 - 17:32

score 473 · Answer 5 · 2020-07-17 10:09:19

473

Views

Proof by Induction: Prove that $2^n > n^2$, for all natural numbers greater than or equal to $5$

Published on 17 Jul 2020 - 10:09

score 2.7k · Answer 6 · 2020-07-17 16:01:35

2.7k

Views

Cubes as the sum of odd integers

Published on 17 Jul 2020 - 16:01

score 99 · Answer 7 · 2026-03-28 03:26:05

99

Views

Proof verification that $t(n+1)=t(n) + \pi$ using mathematical induction

Published on 28 Mar 2026 - 3:26

score 151 · Answer 8 · 2020-07-18 05:26:25

Show using Bernoulli inequality approach (using induction, & transitivity) $2^n \ge n^2, \ \ \forall n\ge 4, n\in \mathbb{N}$.

score 94 · Answer 9 · 2026-04-09 15:18:49

94

Views

Prove an inequality by induction

Published on 09 Apr 2026 - 15:18

score 885 · Answer 10 · 2026-04-12 09:33:26

885

Views

How do I use structural induction to show that for all $(a,b) \in S$ that $(a+b) = 4k$ for some $k \in \Bbb Z$?

Published on 12 Apr 2026 - 9:33

score 224 · Answer 11 · 2026-04-11 03:45:22

224

Views

Different ways for stating the recursion theorem

Published on 11 Apr 2026 - 3:45

score 3k · Answer 12 · 2026-04-11 18:46:55

3k

Views

$5^n -4n-1$ is divisible by 16

Published on 11 Apr 2026 - 18:46

score 39 · Answer 13 · 2020-07-23 14:18:10

39

Views

Prove that a Tower of Height $H$ can be built if $H*(H+1)/2 = R + G$

Published on 23 Jul 2020 - 14:18

score 1.7k · Answer 14 · 2026-04-04 10:17:30

1.7k

Views

Prove that $5^{3^n} + 1$ is divisible by $3^{n + 1}$ for all nonnegative integers $n.$

Published on 04 Apr 2026 - 10:17

score 109 · Answer 15 · 2020-07-24 09:35:03

109

Views

there are chests were we have some coins prove that someday the number of coins in every chest will be the same after some operations

Published on 24 Jul 2020 - 9:35

List Question

how to prove recursive function f(x) is in O(n)?

Prove $n+\left(-1\right)^n\ge \frac{n}{2}$ is true for $n\ge 2$ using induction

Prove that $\frac{1}{1^2} + \frac{1}{2^2} + \cdots + \frac{1}{n^2} > \frac{3n}{2n+1}$ for all $n \geq 2$ by induction

Proof appears to use substitution inconsistently.

Proof by Induction: Prove that $2^n > n^2$, for all natural numbers greater than or equal to $5$

Cubes as the sum of odd integers

Proof verification that $t(n+1)=t(n) + \pi$ using mathematical induction

Show using Bernoulli inequality approach (using induction, & transitivity) $2^n \ge n^2, \ \ \forall n\ge 4, n\in \mathbb{N}$.

Prove an inequality by induction

How do I use structural induction to show that for all $(a,b) \in S$ that $(a+b) = 4k$ for some $k \in \Bbb Z$?

Different ways for stating the recursion theorem

$5^n -4n-1$ is divisible by 16

Prove that a Tower of Height $H$ can be built if $H*(H+1)/2 = R + G$

Prove that $5^{3^n} + 1$ is divisible by $3^{n + 1}$ for all nonnegative integers $n.$

there are chests were we have some coins prove that someday the number of coins in every chest will be the same after some operations

Trending Questions

Popular # Hahtags

Popular Questions