Question

Height of quasi-complete binary tree

score 250 · Answer 1 · 2026-04-15 15:17:25

250

Views

Height of quasi-complete binary tree

Published on 15 Apr 2026 - 15:17

score 141 · Answer 2 · 2026-04-14 03:58:53

141

Views

Proving $1+\sum_{i=1}^n i (i!)=(n+1)!$

Published on 14 Apr 2026 - 3:58

score 3.7k · Answer 3 · 2026-04-15 20:10:44

3.7k

Views

Proof of an inequality by induction: $(1 + x_1)(1 + x_2)...(1 + x_n) \ge 1 + x_1 + x_2 + ... + x_n$

Published on 15 Apr 2026 - 20:10

score 65 · Answer 4 · 2026-04-14 13:35:24

65

Views

prove by mathematical induction

Published on 14 Apr 2026 - 13:35

score 3.4k · Answer 5 · 2026-04-14 22:47:10

3.4k

Views

Inverse of a product in a group can be written as the product of the inverses of each element in reverse order

Published on 14 Apr 2026 - 22:47

score 2.8k · Answer 6 · 2026-04-11 14:26:56

2.8k

Views

Proof of the second principle of mathematical induction

Published on 11 Apr 2026 - 14:26

score 167 · Answer 7 · 2026-04-17 06:12:12

167

Views

Proof via strong induction of a string output

Published on 17 Apr 2026 - 6:12

score 1.1k · Answer 8 · 2026-04-14 04:45:36

1.1k

Views

Cantor Set and Base 3 Decimal Expansions

Published on 14 Apr 2026 - 4:45

score 684 · Answer 9 · 2026-04-30 02:04:19

684

Views

Proof by induction summation inequality: $\sum_{i=1}^n i^2 = O(n^3)$

Published on 30 Apr 2026 - 2:04

score 976 · Answer 10 · 2026-04-13 05:17:49

976

Views

Proving the existence of a Bijection between Cartesian Products of Sets by Induction

Published on 13 Apr 2026 - 5:17

score 77 · Answer 11 · 2026-04-14 19:21:03

77

Views

Power of two commuting elements in a group is the binary operation of each of the two elements raised to that power

Published on 14 Apr 2026 - 19:21

score 162 · Answer 12 · 2026-04-14 14:31:24

162

Views

Proof that $\sum_{i=1}^n{1} = n$ for all $n \in \Bbb Z^+$

Published on 14 Apr 2026 - 14:31

score 72 · Answer 13 · 2026-04-16 00:46:52

72

Views

For what natural number $n$ is the following inequality true: $2^n \geq 2\cdot n^2$?

Published on 16 Apr 2026 - 0:46

score 773 · Answer 14 · 2026-03-26 20:44:31

773

Views

How is induction justified in intuitionistic logic?

Published on 26 Mar 2026 - 20:44

score 471 · Answer 15 · 2026-04-30 02:02:20

471

Views

summation inequality with logarithms

Published on 30 Apr 2026 - 2:02

List Question

Height of quasi-complete binary tree

Proving $1+\sum_{i=1}^n i (i!)=(n+1)!$

Proof of an inequality by induction: $(1 + x_1)(1 + x_2)...(1 + x_n) \ge 1 + x_1 + x_2 + ... + x_n$

prove by mathematical induction

Inverse of a product in a group can be written as the product of the inverses of each element in reverse order

Proof of the second principle of mathematical induction

Proof via strong induction of a string output

Cantor Set and Base 3 Decimal Expansions

Proof by induction summation inequality: $\sum_{i=1}^n i^2 = O(n^3)$

Proving the existence of a Bijection between Cartesian Products of Sets by Induction

Power of two commuting elements in a group is the binary operation of each of the two elements raised to that power

Proof that $\sum_{i=1}^n{1} = n$ for all $n \in \Bbb Z^+$

For what natural number $n$ is the following inequality true: $2^n \geq 2\cdot n^2$?

How is induction justified in intuitionistic logic?

summation inequality with logarithms

Trending Questions

Popular # Hahtags

Popular Questions