Daily · 2026-07-25
One bite-sized math problem set for the day. Solve the ten multiple-choice problems and reveal the worked solutions.
For the polynomial with roots , the product equals:
A menu offers appetizers, mains, and desserts. The number of distinct three-course meals is:
The volume generated by rotating on about the -axis is:
Find the determinant whose entries are all limit values (see problem image).
Using Pascal's identity
Let be defined by
The solution of
A square matrix is invertible iff:
How many subsets of have an even sum (the empty subset counts, with sum )?
Given
.
Cylinder of radius and height : .
Evaluate each of the nine limits to fill the matrix:
Expand along row 1. The cofactor of the entry is :
Cofactors of the and entries are
Add the three contributions:
By Pascal: .
Left branch (): , strictly increasing. Right branch (
Invertibility ⇔ non-zero determinant.
Pair each subset with (i.e., toggle the element ). This pairing has no fixed points and flips the parity of the sum, so even-sum and odd-sum subsets are equinumerous: .
Eliminate the first column using and
The two images and are disjoint and together cover all of , so is surjective. Each branch is strictly increasing, and the ranges don't overlap, so no two distinct -values give the same — is injective. Hence is bijective.
(Note: and , so distractor A is factually false.)
For rank , these two rows must be proportional. Matching the second components gives ratio :
So the answer is: