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

Home > Just Math
2/5 ≤ m/n ≤ 3/5 (Posted on 2009-10-20) Difficulty: 3 of 5
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.

No Solution Yet Submitted by K Sengupta    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Eureka! (spoiler) | Comment 4 of 7 |
(In reply to Eureka! (spoiler) by Steve Herman)

Nice proof.

In response to your part D)
n=5, m=2

00000
00011
00101
01001
10001

which can be extended to n=5a, m=2a

0000000000
0000001111
0000110011
0011000011
1100000011

but have not found others

  Posted by Jer on 2009-10-22 10:42:22

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:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information