All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Bonjour, Pascal ! (Posted on 2013-04-10) Difficulty: 3 of 5
There is endless number of surprising features in a Pascal's Triangle.
One of them is the following theorem, for you to prove:
The number of odd entries in row N of Pascal's Triangle is 2k.

Bonus: How does k relate to the number of ones in the binary expansion of the number N?

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: Solution - FixedOmri2014-09-02 12:09:08
SolutionOmri2014-09-02 11:20:21
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information