Daily · 2026-08-24
One bite-sized math problem set for the day. Solve the 10 multiple-choice problems and reveal the worked solutions.
The mode of is:
The value appearing most often is (three times).
The function has a local maximum at:
. , confirming a local maximum.
The set of all finite strings over an alphabet , with concatenation, is:
Concatenation is associative; the empty string is the identity. No inverses exist (you can't "uncreate" letters), so this is a monoid (not a group). It's the free monoid on .
The smallest non-abelian group has order:
(or equivalently ) has elements and is non-abelian. All groups of order are abelian.
On , has exactly:
. On : . Four solutions.
The numbers , , are in geometric progression (with positive ratio). Determine .
(positive ratio).
— square matrices under multiplication — is:
Matrix multiplication is associative. The identity matrix is the identity. But the zero matrix has no inverse, so not all elements are invertible — it's a monoid but not a group.
Solve the equation for , .
Simplify the exponent on the right: , so :
Recall the combinatorial symmetry:
Since , the symmetry forces :
equals:
.
The function is decreasing on:
. So is decreasing on . (Increasing on and .)