3

Let $S$ be a set of real numbers satisfying the following conditions:

i. $0$ is in $S$.

ii. Whenever $x$ is in $S$ then $2^x+3^x$ is in S.

iii. Whenever $x^2+x^3$ is in $S$ then $x$ is in $S$.

How can I prove that $S$ contains at least two distinct numbers between $0$ and $1$, i.e., (0, 1)?

Somebody
  • 313

2 Answers2

3

by (i) $0 \in S$

by (ii) $2^0 + 3^0 = 2 \in S$

now $2 = 1^3 + 1^2$ so by (iii) $1 \in S$

now $1 = \theta^2 + \theta^3$ where $\theta = 0.7548776662\ldots$ so by (iii) $\theta \in S$.

2

Use ii to show $2$ is in $S$. Then solve $x^3+x^2-2=0$ to.get two more elements, one of which is $-1$ so ii.gets you $5/6$. Solve$x^3+x^2=1$ for another.

Added: if you replace condition i by: there is a positive number in $S$, then you can use iii alone because $x^3+x^2$ is monotonic. Given $y$ in $S$ there is $y'\lt \sqrt[3]y$ in $S$ and you can keep going down until you are below$~1$

Ross Millikan
  • 374,822