(2n choose n) is never a perfect power

Source: Cute problem sent by Sudeep Kanath

Problem: Prove that (2n choose n) is never a perfect power

Update ( 21 June 2014 ):
Solution: Posted by Sandeep, Dinesh Krithivasan and Vishal Khatri in comments.


Comments

  1. Sandeep6:56 PM, February 17, 2014

    There is always atleast one prime between n and 2n. (Bertrand's postulate). These primes occur only once in factorization of 2nCn. So, 2nCn can never be a perfect power.

    ReplyDelete
  2. Dinesh Krithivasan12:24 PM, February 18, 2014

    Direct consequence of Bertrand's postulate. After canceling out one of the n! in the denominator, the numerator will be the product of (n+1)(n+2)... up to 2n. By Bertrand's postulate, there is a prime in this group of numbers, say p. Then, (2n choose n) is divisible by p but not any powers of p and so cannot be a perfect power.

    This is probably nuking a mosquito though - there ought to be a simple proof.

    ReplyDelete
    Replies
    1. Dinesh Krithivasan12:23 AM, February 20, 2014

      Most proofs of Bertrand's postulate (at least the ones on wiki) start by studying the prime factorization of 2nCn. So, this reasoning is likely to be circular.

      Delete
    2. Pratik Poddar2:07 AM, June 21, 2014

      Thanks.

      Delete
  3. Anonymous1:12 AM, April 01, 2014

    It will always be some power of 2 multiplied with some odd number. So, it can't be a perfect power.

    ReplyDelete
    Replies
    1. Pratik Poddar2:04 AM, June 21, 2014

      ?? Wrong solution!

      Delete
    2. Anonymous11:57 PM, June 30, 2014

      Just saw your comment on this..I agree, I have written it wrong... just have to work out again to what i wanted to write. Thanks for bringing it to notice :-)

      Delete
    3. Anonymous12:11 AM, July 01, 2014

      I meant to say that it will always be a power of 2 multiplied with some odd numbers of which at least one would a prime. And after reading the comments above and below, I noticed that the prime would be lying in n to 2n.
      So, I wrote it wrong, Thank you for pointing out :-)

      Delete
  4. Anonymous7:59 PM, June 17, 2014

    There is always a prime between n and 2n. Hence!

    ReplyDelete
  5. Unknown2:16 PM, July 07, 2014

    Bertrand's postulate it is !!!
    http://en.wikipedia.org/wiki/Bertrand%27s_postulate

    ReplyDelete

Post a Comment

Popular posts from this blog

Fraction Brainteaser

Source: Sent to me by Gaurav Sinha Problem: Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions.  In total, Siddhant scores 25 out of 34.  Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34. Note that a) Vaibhav scores more than Siddhant b) Siddhant score better than Vaibhav in both individual topics -  5/6 > 20/25 and 20/28 > 6/9 How is it possible? 
Read more

Buying Dimsums

Source: Alok Goyal (Stellaris VP, Ex-Helion VC) puzzle blog Problem: A fast food restaurant sells dimsums in boxes of 7 and 3. What’s the greatest number of dimsums a person cannot buy. Generalize it for p and q where p and q are relatively prime. I loved the puzzle. Hope you enjoy it too.
Read more

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process. 1) Calculate P{X>Y} 2) What's the expected value of X 3) What's the expected value of Y This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment. Solution: 1) (Solved by me finally after 13 months :)) Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently. So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0" f(State) = P(X>Y | "State" configuration initially)
Read more