[thylacine]

[ 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?