Two Plus Two Newer Archives  

Go Back   Two Plus Two Newer Archives > Other Topics > Science, Math, and Philosophy

Reply
 
Thread Tools Display Modes
  #1  
Old 11-26-2007, 04:49 PM
sirio11 sirio11 is offline
Senior Member
 
Join Date: Aug 2003
Location: I\'m mad as hell and I can\'t take it anymore ....
Posts: 3,516
Default A Olympiad problem (original creation)

I have created many Olympiad problems, most of them for regional, state and National (Mexico) contests. This is not the one I'm proud the most, just one I find interesting and with a short solution.


(n,r) means nCr

Find all positive integers n,z,k that satisfy:

(n,0)^2+(n,1)^2+(n,2)^2+.....+(n,n)^2 = z^k
Reply With Quote
  #2  
Old 11-26-2007, 07:43 PM
jay_shark jay_shark is offline
Senior Member
 
Join Date: Sep 2006
Posts: 2,277
Default Re: A Olympiad problem (original creation)

LHS = nC0*ncn + nC1*nC(n-1) + nC2*nC(n-2) +...+nCn*nC0

Suppose you have n girls and n boys to choose from to make a sports team but you must select n players . The total number of teams using n players is the lhs . It is also equivalent to 2nCn since we must select n players from 2n players .

So z^k = (2nCn)^1

We have an immediate solution n=n , z=2nCn and k=1 . We need to show that the kth root of 2nCn is not an integer for k>=2 .

Now we use the fact that there is always a prime number between n and 2n . This means that the prime factorization of 2nCn contains some prime number between n and 2n which is used only once . Therefore it cannot possibly be used k times (for k>=2) which is the lhs of the equation .

The solutions are (n,z,k) = (n,2nCn ,1)
Reply With Quote
  #3  
Old 11-27-2007, 11:13 PM
thylacine thylacine is offline
Senior Member
 
Join Date: Jul 2003
Posts: 1,175
Default Re: A Olympiad problem (original creation)

[ QUOTE ]
LHS = nC0*ncn + nC1*nC(n-1) + nC2*nC(n-2) +...+nCn*nC0

Suppose you have n girls and n boys to choose from to make a sports team but you must select n players . The total number of teams using n players is the lhs . It is also equivalent to 2nCn since we must select n players from 2n players .

So z^k = (2nCn)^1

We have an immediate solution n=n , z=2nCn and k=1 . We need to show that the kth root of 2nCn is not an integer for k>=2 .

Now we use the fact that there is always a prime number between n and 2n . This means that the prime factorization of 2nCn contains some prime number between n and 2n which is used only once . Therefore it cannot possibly be used k times (for k>=2) which is the lhs of the equation .

The solutions are (n,z,k) = (n,2nCn ,1)

[/ QUOTE ]

Is there a solution that doesn't use Erdos's poem?
Reply With Quote
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -4. The time now is 07:19 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.