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

Home > Just Math
Close neighbours (Posted on 2013-04-15) Difficulty: 3 of 5
Denote by S the set of all binary integers that can be written using exactly m zeros and n ones, leading zeros permitted.

How many couples in this set differ exactly by one?

Check your formula for m=6, n=3 and for m=3, n=6.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionsolutionCharlie2013-04-15 16:28:18
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information