Question

Proof by induction: $\sum_{i=1}^{2^n} \frac{1}{2i-1} > \frac{n+3}{4}$ [SOLVED]

score 54 · Answer 1 · 2026-04-16 17:09:47

54

Views

Proof by induction: $\sum_{i=1}^{2^n} \frac{1}{2i-1} > \frac{n+3}{4}$ [SOLVED]

Published on 16 Apr 2026 - 17:09

score 84 · Answer 2 · 2026-04-16 14:03:29

84

Views

Proof or disproof of the existence of a way to flip all bits on a (undirected) graph

Published on 16 Apr 2026 - 14:03

score 49 · Answer 3 · 2026-04-12 13:42:31

49

Views

Logic and function from integers into integers

Published on 12 Apr 2026 - 13:42

score 1.7k · Answer 4 · 2026-04-14 22:10:48

1.7k

Views

Quotient Set of an Equivalence Relation

Published on 14 Apr 2026 - 22:10

score 610 · Answer 5 · 2026-04-13 20:40:35

610

Views

How to determine the period of these matrices?

Published on 13 Apr 2026 - 20:40

score 34.2k · Answer 6 · 2026-04-11 18:42:24

34.2k

Views

How to prove that at least two vertices have the same degree in any graph?

Published on 11 Apr 2026 - 18:42

score 135 · Answer 7 · 2026-03-25 06:10:52

135

Views

Minimize $152207x-81103y$ over the positive integers.

Published on 25 Mar 2026 - 6:10

score 724 · Answer 8 · 2026-04-16 08:38:21

724

Views

Prove that if a graph $G$ has a Hamilton path, then for every $S\subseteq V(G)$, the number of components of $G-S$ is at most $|S|+1$.

Published on 16 Apr 2026 - 8:38

score 30 · Answer 9 · 2026-04-15 21:19:16

30

Views

Proving that a set of relating elements is infinite

Published on 15 Apr 2026 - 21:19

score 515 · Answer 10 · 2026-04-09 07:31:54

515

Views

How can I solve this problem : $2^{x} \equiv{2070442609 \cdots 226509} \pmod {6561}$

Published on 09 Apr 2026 - 7:31

score 161 · Answer 11 · 2026-04-15 23:17:31

161

Views

If an integer $n$ has the form $3k+1$, then $n$ does not have the form $9l+5$

Published on 15 Apr 2026 - 23:17

score 1.2k · Answer 12 · 2026-04-08 18:52:15

1.2k

Views

Negation of Quantified Statements

Published on 08 Apr 2026 - 18:52

score 72 · Answer 13 · 2026-04-16 07:24:07

72

Views

Proof by induction: $a_n > n + \frac{1}{3} \space \forall n \in N,\space n\geq 4$

Published on 16 Apr 2026 - 7:24

score 92 · Answer 14 · 2026-04-11 13:04:03

92

Views

Can I negate this? Discrete Mathematics

Published on 11 Apr 2026 - 13:04

score 30 · Answer 15 · 2026-04-13 01:36:22

30

Views

How can I find the negations of the following propositions?

Published on 13 Apr 2026 - 1:36

List Question

Proof by induction: $\sum_{i=1}^{2^n} \frac{1}{2i-1} > \frac{n+3}{4}$ [SOLVED]

Proof or disproof of the existence of a way to flip all bits on a (undirected) graph

Logic and function from integers into integers

Quotient Set of an Equivalence Relation

How to determine the period of these matrices?

How to prove that at least two vertices have the same degree in any graph?

Minimize $152207x-81103y$ over the positive integers.

Prove that if a graph $G$ has a Hamilton path, then for every $S\subseteq V(G)$, the number of components of $G-S$ is at most $|S|+1$.

Proving that a set of relating elements is infinite

How can I solve this problem : $2^{x} \equiv{2070442609 \cdots 226509} \pmod {6561}$

If an integer $n$ has the form $3k+1$, then $n$ does not have the form $9l+5$

Negation of Quantified Statements

Proof by induction: $a_n > n + \frac{1}{3} \space \forall n \in N,\space n\geq 4$

Can I negate this? Discrete Mathematics

How can I find the negations of the following propositions?

Trending Questions

Popular # Hahtags

Popular Questions