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): Spoiler | Comment 6 of 11 |
(In reply to re: Spoiler by Charlie)

I like the method of using all combinations of the first 9 digits with the 10th being equivalent to 0 mod 10 of the sum of digits.  It is obvious in hindsight that matching the last digit to the first was not sufficient.

Looking for a proof.<o:p></o:p>


  Posted by Leming on 2005-12-01 12:34:52
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
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