Art of Problem Solving
Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

1992 OIM Problems/Problem 4: Difference between revisions

← Older editNewer edit →
Tomasdiaz (talk | contribs)
editor
1,840 edits
No edit summary
Tomasdiaz (talk | contribs)
editor
1,840 edits
No edit summary
Line 24: Line 24:
<math>a_n^2+b_n^2=(n^2+An)^2+(Bn+8)^2</math>
<math>a_n^2+b_n^2=(n^2+An)^2+(Bn+8)^2</math>


<math>a_n^2+b_n^2=(n^2+An)^2+(Bn+8)^2</math>
<math>a_n^2+b_n^2=n^4+2An^3+(A^2+B^2)n^2+16Bn+8^2=S^2</math>


<math>a_n^2+b_n^2=n^4+2An^3+(A^2+B^2)n^2+16Bn+8^2</math>
Let <math>S^2=(n^2+Kn+8)^2</math>


<math>S^2=n^4+2Kn^3+(16+K^2)n^2+16Kn+8^2</math>




Revision as of 20:19, 19 December 2023

Problem

Let $(a_n)$ and $(b_n)$ be two sequences of integers that verify the following conditions:

i. $a_0 = 0$, $b_0 = 8$

ii. For all $n \geq 0$, $a_{n+2}=2a_{n+1}-a_{n}+2$, $b_{n+2}=2b_{n+1}-b_{n}$

iii. $a_{n}^{2}+b_{n}^{2}$ is a perfect square for all $n\ge 0$

Find at least two values of pair $(a_{1992},b_{1992})$.


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

Solution

First we find the non-recursive form of this with unknown $a_1$ and $b_1$:

$a_n=na_1+n(n+1))$, and $b_n=nb_1-8(n-1)$

Let $A=a_1-1$, and $B=b_1-8$

$a_n=n^2+An$, and $b_n=Bn+8$

$a_n^2+b_n^2=(n^2+An)^2+(Bn+8)^2$

$a_n^2+b_n^2=n^4+2An^3+(A^2+B^2)n^2+16Bn+8^2=S^2$

Let $S^2=(n^2+Kn+8)^2$

$S^2=n^4+2Kn^3+(16+K^2)n^2+16Kn+8^2$



  • Note. I actually competed at this event in Venezuela when I was in High School representing Puerto Rico. I think I got like 2 or 3 points out of 1 on this one. I don't remember what I did.

Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

See also

https://www.oma.org.ar/enunciados/ibe7.htm

Retrieved from "https://wiki.aopstest.com/wiki/index.php?title=1992_OIM_Problems/Problem_4&oldid=207938"