![](/images/dot.gif)
Home > Just Math
Close neighbours (Posted on 2013-04-15) |
|
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.
Comments: (
You must be logged in to post comments.)
|
Subject |
Author |
Date |
![Solution Solution](/images/perplexus/icons/solution.gif) | solution | Charlie | 2013-04-15 16:28:18 |
|
![](/images/dot.gif) |
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|