Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
1 .
What does
∑
k
=
2
n
−
1
(
k
−
1
)
(
n
−
k
)
count?
(a)
The number of 3-element subsets of an
(
n
−
1
)
-element set.
(b)
The number of 3-element subsets of an
n
-element set.
(c)
The number of times you fart when running algorithm
S
I
L
L
Y
(
n
)
.
(d)
The number of 3-element subsets of an
(
n
+
1
)
-element set.
Submit
Refresh