Difference between revisions of "2009 OIM Problems/Problem 5"

(Created page with "== Problem == The sequence <math>a_n</math> is defined by <math>a_1 = 1, a_{2k} = 1 + a_k</math>, and <math>a_{2k+1} = \frac{1}{a_{2k}}, for all integer </math>k \ge 1$. Prov...")
 
 
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
The sequence <math>a_n</math> is defined by <math>a_1 = 1, a_{2k} = 1 + a_k</math>, and <math>a_{2k+1} = \frac{1}{a_{2k}}, for all integer </math>k \ge 1$.  Prove that every positive rational number appears exactly once in this sequence.
+
The sequence <math>a_n</math> is defined by <math>a_1 = 1, a_{2k} = 1 + a_k</math>, and <math>a_{2k+1} = \frac{1}{a_{2k}}</math>, for all integer <math>k \ge 1</math>.  Prove that every positive rational number appears exactly once in this sequence.
  
 
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
 
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Latest revision as of 15:24, 14 December 2023

Problem

The sequence $a_n$ is defined by $a_1 = 1, a_{2k} = 1 + a_k$, and $a_{2k+1} = \frac{1}{a_{2k}}$, for all integer $k \ge 1$. Prove that every positive rational number appears exactly once in this sequence.

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions