NMO problem

Discussion on Bangladesh Mathematical Olympiad (BdMO) National
willpower
Posts:30
Joined:Tue Nov 01, 2011 6:30 pm
Location:Pakistan
NMO problem

Unread post by willpower » Tue Nov 01, 2011 6:51 pm

I need help with the following problem:
Prove that if an arithmetical progression of positive integers contains a square, then it contains infinitely many squares.
Hope to get a solution asap. :) Thank you!

sourav das
Posts:461
Joined:Wed Dec 15, 2010 10:05 am
Location:Dhaka
Contact:

Re: NMO problem

Unread post by sourav das » Tue Nov 01, 2011 7:20 pm

Let $a_i = a_0 + n r $ is an arithmatic progression for $n= 0, 1, 2...$
Let $a_c=m^2 = a_0 + c r$ a perfect square in the sequence. then put $ n=c+2m+r $
then$a_{c+2m+r} = a_0 + (c+2m+r)r = a_0 +cr + 2mr + r^2 = m^2 +2mr + r^2=(m+r)^2$ And so there are infinitely many squares in the sequence.
You spin my head right round right round,
When you go down, when you go down down......
(-$from$ "$THE$ $UGLY$ $TRUTH$" )

willpower
Posts:30
Joined:Tue Nov 01, 2011 6:30 pm
Location:Pakistan

Re: NMO problem

Unread post by willpower » Tue Nov 01, 2011 7:32 pm

Why do we put this expression "n=c+2m+r" into the original formula?
Also, I knew that the nth term of an arithmetic progression could be written as "a + (n-1)d". I'm not aware of the form used. :S
Everybody is a genius; but if you judge a fish on its ability to climb a tree, it will live its entire life believing that it is stupid. - Albert Einstein

User avatar
*Mahi*
Posts:1175
Joined:Wed Dec 29, 2010 12:46 pm
Location:23.786228,90.354974
Contact:

Re: NMO problem

Unread post by *Mahi* » Tue Nov 01, 2011 7:45 pm

Just replace $n-1 \rightarrow n$,$a \rightarrow a_0$ and $d \rightarrow r$ to derive one formula from another.
And the theme of this solution is called "completing the square"
Please read Forum Guide and Rules before you post.

Use $L^AT_EX$, It makes our work a lot easier!

Nur Muhammad Shafiullah | Mahi

sourav das
Posts:461
Joined:Wed Dec 15, 2010 10:05 am
Location:Dhaka
Contact:

Re: NMO problem

Unread post by sourav das » Tue Nov 01, 2011 7:51 pm

I just work backward.I assume if $a_c=m^2$ then let $a_x=k^2$ and $K>m$. We have to find $x$.Now $ K^2 -m^2=r(x-c)$. Now i just test it by putting $k-m=r$ then i found that $x=c+2m+r$ and it works. :D
You spin my head right round right round,
When you go down, when you go down down......
(-$from$ "$THE$ $UGLY$ $TRUTH$" )

willpower
Posts:30
Joined:Tue Nov 01, 2011 6:30 pm
Location:Pakistan

Re: NMO problem

Unread post by willpower » Tue Nov 01, 2011 7:58 pm

I didn't get the last step. The part where you say: "Now i just test it by putting k−m=r then i found that x=c+2m+r and it works. " How come?
It's my first time at such questions. Kindly elaborate. Thanks. :)
Everybody is a genius; but if you judge a fish on its ability to climb a tree, it will live its entire life believing that it is stupid. - Albert Einstein

sourav das
Posts:461
Joined:Wed Dec 15, 2010 10:05 am
Location:Dhaka
Contact:

Re: NMO problem

Unread post by sourav das » Tue Nov 01, 2011 8:07 pm

First, don't be afraid to question where you can't understand in this forum. In our L.H.S=$k^2 -m^2$ = $(k+m)(k-m)$
R.H.S.=$r(x-c)$ . So $r|(k+m)(k-m)$ . That's why i was curious what will happen if $r=k-m$. And the trick worked!
You spin my head right round right round,
When you go down, when you go down down......
(-$from$ "$THE$ $UGLY$ $TRUTH$" )

willpower
Posts:30
Joined:Tue Nov 01, 2011 6:30 pm
Location:Pakistan

Re: NMO problem

Unread post by willpower » Tue Nov 01, 2011 8:33 pm

As far as I have gathered from the posts above, we first write down the general formula of an A.P:
$a_i=a_0+nr$
Then we represent a perfect square using this notation: $a_c = a_0+cr = m^2$
Let $a_x = k^2$ where $k > m$
=>$ k^2 - m^2 = a_x - a_c$
=> $(k+m)(k-m) = r (x - c)$
We next assume that $r = k - m$.
How do you then find $x$?
Everybody is a genius; but if you judge a fish on its ability to climb a tree, it will live its entire life believing that it is stupid. - Albert Einstein

User avatar
nafistiham
Posts:829
Joined:Mon Oct 17, 2011 3:56 pm
Location:24.758613,90.400161
Contact:

Re: NMO problem

Unread post by nafistiham » Tue Nov 01, 2011 8:46 pm

then you can say
$k+m=x-c$
or,$x=k+m+c$
or,$x=k-m+2m+c$
or,$x=r+2m+c$
\[\sum_{k=0}^{n-1}e^{\frac{2 \pi i k}{n}}=0\]
Using $L^AT_EX$ and following the rules of the forum are very easy but really important, too.Please co-operate.
Introduction:
Nafis Tiham
CSE Dept. SUST -HSC 14'
http://www.facebook.com/nafistiham
nafistiham@gmail

willpower
Posts:30
Joined:Tue Nov 01, 2011 6:30 pm
Location:Pakistan

Re: NMO problem

Unread post by willpower » Tue Nov 01, 2011 8:54 pm

Thanks a bunch! I finally understand. :P
Everybody is a genius; but if you judge a fish on its ability to climb a tree, it will live its entire life believing that it is stupid. - Albert Einstein

Post Reply