Let be the set of numbers in whose decimal representations consist of only s and (finitely many) s. For example, is in this set, as is and .
Note that not every subset of has a maximum. For example, has no maximum. (It has a limit , but that's not in so it doesn't count.)
We can divide into pieces. Let be the set of numbers in with only one . That is, . Let be the set of numbers in with exactly two s. That is, . More generally, let be the set of numbers in with exactly s.
Note that .
Prove that, for every , every subset of has a maximum.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.