Difference between revisions of "2003 OIM Problems/Problem 6"
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | Sequences <math>(a_n)_{n \ge 0}</math>, and <math>(b_n)_{n \ge 0}</math> | + | Sequences <math>(a_n)_{n \ge 0}</math>, and <math>(b_n)_{n \ge 0}</math> are defined by: |
<cmath>a_0=1 \text{, }b_0=4\text{, and}</cmath> | <cmath>a_0=1 \text{, }b_0=4\text{, and}</cmath> | ||
Latest revision as of 03:35, 14 December 2023
Problem
Sequences 
, and 
are defined by:
![\[a_0=1 \text{, }b_0=4\text{, and}\]](http://latex.artofproblemsolving.com/c/6/e/c6e6af268ab953f1fbc3de325f74019c3d5317fa.png)
![\[a_{n+1}=a_n^{2001}+b_n\text{, for }n \ge 0\text{.}\]](http://latex.artofproblemsolving.com/3/5/e/35e31f66225c73b04cc439fb8e2f77f0ae18fbc3.png)
![\[b_{n+1}=b_n^{2001}+a_n\text{, for }n \ge 0\text{.}\]](http://latex.artofproblemsolving.com/b/6/2/b62307a6806d57e18e7a905ac1f1e2b126621e88.png)
Show that 2003 does not divide any of the terms of these sequences.
~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.
