perplexus.info :: Just Math : 2/5 ≤ m/n ≤ 3/5

2/5 ≤ m/n ≤ 3/5 (Posted on 2009-10-20)

Five distinct n-digit binary numbers are such that for any two numbers chosen from them the digits will coincide in precisely m places. There is no place with the common digit for all the five numbers. At least one of the binary numbers contains leading zero.

Prove that 2/5 ≤ m/n ≤ 3/5.

See The Solution Submitted by K Sengupta

Rating: 4.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Thanks Justin

Comment 7 of 7 |

I was interested in your examples.

We had already proved that m and n must either be both odd or both even, and that 2/5 <= m/n <= 3/5, so that means that m must be the following (as a function of n)

n m

-- -------

3 none

4 2 (but impossible for other reasons)

5 3

6 none

7 3

8 4

9 5

10 4 or 6

11 5

12 6

13 5 or 7

14 6 or 8

15 7 or 9 or 11

etc.

Posted by Steve Herman on 2011-01-08 14:52:07

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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info