Question

Trying to prove $\log\left(n!\right)$ is greater than or equal to $\left(\frac{n}{2}\log\left(n\right)\right)$

score 67 · Answer 1 · 2018-11-08 19:39:33

67

Views

Trying to prove $\log\left(n!\right)$ is greater than or equal to $\left(\frac{n}{2}\log\left(n\right)\right)$

Published on 08 Nov 2018 - 19:39

score 67 · Answer 2 · 2026-04-12 19:30:58

67

Views

Proving Set Equality $A=B$

Published on 12 Apr 2026 - 19:30

score 176 · Answer 3 · 2026-04-11 22:39:52

176

Views

Disjunctive normal form from a truth table

Published on 11 Apr 2026 - 22:39

score 160 · Answer 4 · 2026-04-08 21:06:09

160

Views

Proof by induction with unknown formula?

Published on 08 Apr 2026 - 21:06

score 48 · Answer 5 · 2018-11-09 02:36:29

48

Views

Find the number of positive integers n between $1$ and $100$ that are not a multiple of $3$ or $11$.

Published on 09 Nov 2018 - 2:36

score 50 · Answer 6 · 2026-04-10 10:32:42

50

Views

Var(X) for X as given

Published on 10 Apr 2026 - 10:32

score 664 · Answer 7 · 2026-04-03 11:06:32

664

Views

Determine all pairs (k, n) such that there exists a k-regular graph on n vertices

Published on 03 Apr 2026 - 11:06

score 278 · Answer 8 · 2026-04-11 08:03:52

278

Views

What is ({({(∅)})}) explicit written?

Published on 11 Apr 2026 - 8:03

score 360 · Answer 9 · 2026-04-13 09:59:16

360

Views

Computing 2 to the power of some value without calculator

Published on 13 Apr 2026 - 9:59

score 37 · Answer 10 · 2026-04-12 18:13:49

37

Views

logic connectives and symbols "most"

Published on 12 Apr 2026 - 18:13

score 323 · Answer 11 · 2026-04-13 10:38:25

323

Views

Verifying the validity of a structural induction proof

Published on 13 Apr 2026 - 10:38

score 110 · Answer 12 · 2026-03-25 07:43:41

110

Views

Prove that a $d$-regular, $d$-edge-connected graph $G$ is tough when $d\geq3$.

Published on 25 Mar 2026 - 7:43

score 704 · Answer 13 · 2026-04-13 00:44:50

704

Views

What is the probability that the first bin is empty?

Published on 13 Apr 2026 - 0:44

score 308 · Answer 14 · 2026-04-13 09:34:02

308

Views

The second term of an arithmetic series is the third term of a geometric series; etc, etc, etc.

Published on 13 Apr 2026 - 9:34

score 3.4k · Answer 15 · 2026-03-25 03:21:13

3.4k

Views

Number of $13$-card hands satisfying the stated conditions

Published on 25 Mar 2026 - 3:21

List Question

Trying to prove $\log\left(n!\right)$ is greater than or equal to $\left(\frac{n}{2}\log\left(n\right)\right)$

Proving Set Equality $A=B$

Disjunctive normal form from a truth table

Proof by induction with unknown formula?

Find the number of positive integers n between $1$ and $100$ that are not a multiple of $3$ or $11$.

Var(X) for X as given

Determine all pairs (k, n) such that there exists a k-regular graph on n vertices

What is ({({(∅)})}) explicit written?

Computing 2 to the power of some value without calculator

logic connectives and symbols "most"

Verifying the validity of a structural induction proof

Prove that a $d$-regular, $d$-edge-connected graph $G$ is tough when $d\geq3$.

What is the probability that the first bin is empty?

The second term of an arithmetic series is the third term of a geometric series; etc, etc, etc.

Number of $13$-card hands satisfying the stated conditions

Trending Questions

Popular # Hahtags

Popular Questions