Question

Structure theorem for graphs with no paths of length $k$.

score 171 · Answer 1 · 2026-04-18 13:26:09

171

Views

Structure theorem for graphs with no paths of length $k$.

Published on 18 Apr 2026 - 13:26

score 351 · Answer 2 · 2026-04-12 08:02:47

351

Views

When negating a "complex" mathematical statement, which part of the statement should be negated?

Published on 12 Apr 2026 - 8:02

score 874 · Answer 3 · 2026-04-16 14:19:22

874

Views

f, g are functions on a dense subset D in R

Published on 16 Apr 2026 - 14:19

score 111 · Answer 4 · 2026-04-14 18:22:14

111

Views

Proving Non-algebraic over $\mathbb{Q}$

Published on 14 Apr 2026 - 18:22

score 86 · Answer 5 · 2026-04-16 08:40:46

86

Views

Can two proofs rely on each other?

Published on 16 Apr 2026 - 8:40

score 802 · Answer 6 · 2026-04-14 03:48:55

802

Views

Prove $2(x^2 + y^2)$ is the sum of two squares

Published on 14 Apr 2026 - 3:48

score 221 · Answer 7 · 2026-04-09 14:37:36

221

Views

Guidelines on using Proof by Contrapositive

Published on 09 Apr 2026 - 14:37

score 34 · Answer 8 · 2026-04-17 08:31:12

34

Views

What is an easier way to prove that $n$ algebraic structures are distinct (non-isomorphic)?

Published on 17 Apr 2026 - 8:31

score 370 · Answer 9 · 2026-04-13 19:20:31

370

Views

Proving that probability measure is monotone

Published on 13 Apr 2026 - 19:20

score 64 · Answer 10 · 2026-04-15 21:26:53

64

Views

Why do proofs use "extreme" cases?

Published on 15 Apr 2026 - 21:26

score 349 · Answer 11 · 2026-04-15 18:21:56

Let $p(x) = a_0 + a_1x + a_2x^2 + \cdots + a_nx^n$ with $a_0,a_1,\dots,a_n \in \Bbb R$. Prove that if $a_0a_n < 0$, then $p$ has a positive root.

score 3.4k · Answer 12 · 2026-04-13 23:40:51

3.4k

Views

Why are direct proofs often considered better than indirect proofs?

Published on 13 Apr 2026 - 23:40

score 72 · Answer 13 · 2026-04-09 10:08:24

72

Views

Prove that this process is a Markov Chain process and display your transition matrix

Published on 09 Apr 2026 - 10:08

score 60 · Answer 14 · 2026-04-15 04:08:43

Negation of "...then $n$ has at least one prime factor $p$ with $1 \lt p \le \sqrt{n}$" for a proof by contradiction.

score 977 · Answer 15 · 2026-04-16 13:26:49

977

Views

Proving that the probability of the union of events is not larger than the sum of the individual probabilities using induction

Published on 16 Apr 2026 - 13:26

List Question

Structure theorem for graphs with no paths of length $k$.

When negating a "complex" mathematical statement, which part of the statement should be negated?

f, g are functions on a dense subset D in R

Proving Non-algebraic over $\mathbb{Q}$

Can two proofs rely on each other?

Prove $2(x^2 + y^2)$ is the sum of two squares

Guidelines on using Proof by Contrapositive

What is an easier way to prove that $n$ algebraic structures are distinct (non-isomorphic)?

Proving that probability measure is monotone

Why do proofs use "extreme" cases?

Let $p(x) = a_0 + a_1x + a_2x^2 + \cdots + a_nx^n$ with $a_0,a_1,\dots,a_n \in \Bbb R$. Prove that if $a_0a_n < 0$, then $p$ has a positive root.

Why are direct proofs often considered better than indirect proofs?

Prove that this process is a Markov Chain process and display your transition matrix

Negation of "...then $n$ has at least one prime factor $p$ with $1 \lt p \le \sqrt{n}$" for a proof by contradiction.

Proving that the probability of the union of events is not larger than the sum of the individual probabilities using induction

Trending Questions

Popular # Hahtags

Popular Questions