MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Harvard-MIT Mathematics Tournament
2022 Harvard-MIT Mathematics Tournament
4
2022 Combinatorics 4
2022 Combinatorics 4
Source:
March 18, 2022
combinatorics
Problem Statement
Compute the number of nonempty subsets
S
⊆
{
−
10
,
−
9
,
−
8
,
.
.
.
,
8
,
9
,
10
}
S \subseteq\{-10,-9,-8, . . . , 8, 9, 10\}
S
⊆
{
−
10
,
−
9
,
−
8
,
...
,
8
,
9
,
10
}
that satisfy
∣
S
∣
+
m
i
n
(
S
)
⋅
max
(
S
)
=
0.
|S| +\ min(S) \cdot \max (S) = 0.
∣
S
∣
+
min
(
S
)
⋅
max
(
S
)
=
0.
Back to Problems
View on AoPS