Difference between revisions of "1993 AHSME Problems/Problem 30"

Revision as of 00:05, 3 January 2016

Problem

Given $0\le x_0<1$ , let $x_n=\left\{ \begin{array}{ll} 2x_{n-1} &\text{ if }2x_{n-1}<1 \\ 2x_{n-1}-1 &\text{ if }2x_{n-1}\ge 1 \end{array}\right.$ for all integers $n>0$ . For how many $x_0$ is it true that $x_0=x_5$ ?

$\text{(A) 0} \quad \text{(B) 1} \quad \text{(C) 5} \quad \text{(D) 31} \quad \text{(E) }\infty$

Solution

We are going to look at this problem in binary.

$x_0 = (0.a_1 a_2 \cdots )_2$

$2x_0 = a_1(a_2 a_3 \cdots)_2$

If $2x_0 < 1$ , then $x_0 < \frac{1}{2}$ which means that $b_1 = 0$ and so $x_1 = (.a_2 a_3 a_4 \cdots)_2$

If $2x_0 \geq 1$ then $x \geq \frac{1}{2}$ which means that $x_1 = 2x_0 - 1 = (.a_2 a_3 a_4 \cdots)_2$ .

Using the same logic, we notice that this sequence cycles and that since $x_0 = x_5$ we notice that $a_n = a_{n+5}$ .

We have $5$ possibilities for each of $a_1$ to $a_5$ but we can't have $a_1 = a_2 = a_3 = a_4 = a_5 = 1$ so we have $2^5 - 1 = \boxed{31}$

-mathman523

$\fbox{D}$

1993 AHSME (Problems • Answer Key • Resources)
Preceded by Problem 29	Followed by Problem 30
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

Revision as of 00:05, 3 January 2016 (view source) Ryanyz10 (talk \| contribs) ← Older edit		Revision as of 00:05, 3 January 2016 (view source) Ryanyz10 (talk \| contribs) m (→‎Solution) Newer edit →
Line 19:		Line 19:

	<math>x_0 = (0.a_1 a_2 \cdots )_2</math>		<math>x_0 = (0.a_1 a_2 \cdots )_2</math>
		+
	<math>2x_0 = a_1(a_2 a_3 \cdots)_2</math>		<math>2x_0 = a_1(a_2 a_3 \cdots)_2</math>

Page

Toolbox

Search

Difference between revisions of "1993 AHSME Problems/Problem 30"

Revision as of 00:05, 3 January 2016

Problem

Solution

See also