Question

Quick Question about inclusion-Exclusion principle

score 214 · Answer 1 · 2026-04-10 15:18:33

214

Views

Quick Question about inclusion-Exclusion principle

Published on 10 Apr 2026 - 15:18

score 161 · Answer 2 · 2026-04-14 01:17:21

161

Views

Any non-recursive definitions for a binary tree?

Published on 14 Apr 2026 - 1:17

score 92 · Answer 3 · 2026-04-15 22:40:30

92

Views

Union of a set of collections

Published on 15 Apr 2026 - 22:40

score 43 · Answer 4 · 2026-04-10 16:04:26

43

Views

Function value in set theory

Published on 10 Apr 2026 - 16:04

score 41 · Answer 5 · 2026-04-23 19:28:57

41

Views

How can we calculate number of subsets by classifying each based on the number of elements?

Published on 23 Apr 2026 - 19:28

score 75 · Answer 6 · 2026-04-13 20:02:26

75

Views

The De Morgan Formulas (for finite sets )

Published on 13 Apr 2026 - 20:02

score 83 · Answer 7 · 2026-04-09 08:44:23

83

Views

Monotone non-(in)decreasing sequences of subsets of $\Omega$

Published on 09 Apr 2026 - 8:44

score 66 · Answer 8 · 2026-04-17 00:16:12

66

Views

Let $f:[a,b] \to \mathbb{R}$ be bounded, prove that if $ L(f,P_1)<L(f,P_2)$ then $U(f,P_2)<U(f,P_1)$

Published on 17 Apr 2026 - 0:16

score 56 · Answer 9 · 2026-04-16 23:02:02

56

Views

Suppose that $(k_n\mid n\in\mathbb N)$ is a decreasing sequence in $\mathbb N$. Then $(k_n\mid n\in\mathbb N)$ is eventually constant.

Published on 16 Apr 2026 - 23:02

score 78 · Answer 10 · 2026-04-11 00:53:23

78

Views

Universe of a Union of Sets

Published on 11 Apr 2026 - 0:53

score 146 · Answer 11 · 2026-04-14 12:19:24

146

Views

Is there an "easy" way to prove the general version Hall's Marriage Theorem?

Published on 14 Apr 2026 - 12:19

score 722 · Answer 12 · 2026-04-24 00:49:47

722

Views

How can we say that the number of disjoint subsets of a set containing n elements is 1+ $\frac{3^{n} - 1}{2}$

Published on 24 Apr 2026 - 0:49

score 2k · Answer 13 · 2026-04-13 12:48:09

2k

Views

Does order of the components in a set matter?

Published on 13 Apr 2026 - 12:48

score 49 · Answer 14 · 2026-04-15 11:35:47

49

Views

Consider a set $ \ A \ $ with $ \ n>0 \ $elements , $ \ \mathcal{O}=\{B \subset A: \ |B| \ \ is \ \ odd \} \ $

Published on 15 Apr 2026 - 11:35

score 329 · Answer 15 · 2026-04-14 04:42:34

329

Views

Cambridge Tripos 2015: Partial Order Extended to Total Order Proof

Published on 14 Apr 2026 - 4:42

List Question

Quick Question about inclusion-Exclusion principle

Any non-recursive definitions for a binary tree?

Union of a set of collections

Function value in set theory

How can we calculate number of subsets by classifying each based on the number of elements?

The De Morgan Formulas (for finite sets )

Monotone non-(in)decreasing sequences of subsets of $\Omega$

Let $f:[a,b] \to \mathbb{R}$ be bounded, prove that if $ L(f,P_1)<L(f,P_2)$ then $U(f,P_2)<U(f,P_1)$

Suppose that $(k_n\mid n\in\mathbb N)$ is a decreasing sequence in $\mathbb N$. Then $(k_n\mid n\in\mathbb N)$ is eventually constant.

Universe of a Union of Sets

Is there an "easy" way to prove the general version Hall's Marriage Theorem?

How can we say that the number of disjoint subsets of a set containing n elements is 1+ $\frac{3^{n} - 1}{2}$

Does order of the components in a set matter?

Consider a set $ \ A \ $ with $ \ n>0 \ $elements , $ \ \mathcal{O}=\{B \subset A: \ |B| \ \ is \ \ odd \} \ $

Cambridge Tripos 2015: Partial Order Extended to Total Order Proof

Trending Questions

Popular # Hahtags

Popular Questions