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

Home > Numbers
Easily distinguished codes (Posted on 2005-11-29) Difficulty: 4 of 5
A certain company gives each of its clients a 10 digit number as a sort of identification code. As a precaution, any pair of used codes should differ by at least two digits so no one accidentally gives someone else's code.

How many clients can they have before adding digits? Give an example of a set of codes they might use. What if each pair of codes must differ by at least 3 digits? 4? More?

See The Solution Submitted by Tristan    
Rating: 4.5000 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): 3+ digits? | Comment 10 of 11 |
(In reply to re: 3+ digits? by goFish)

You're proving that you cannot add more numbers to the existing set, but how do you know that you can't "trade," say, 10 of the numbers already in the set for 11 numbers not in the set?

As a counterexample, consider this set using 3-digit binary numbers: {000, 111}
I cannot add any more elements to this set such that all elements are more than 1 digit away.  And yet, I can think of a 4-element set that satisfies the requirements:
{000, 011, 101, 110}

I'm not sure whether or not it would be difficult to fix your proof.

  Posted by Tristan on 2006-02-26 02:02:53

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

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