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

Home > Just Math
Digit equivalence (Posted on 2021-06-22) Difficulty: 3 of 5
Consider the set S of all integers between and including 1000 and 99999. Call two integers x and y in S to be in the same equivalence class if the digits appearing in x and y are the same. For example, if x=1010, y=1000 and z=1201, then x and y are in the same equivalence class, but y and z are not. Find the number of distinct equivalent classes that can be formed out of S.

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Puzzle AnswerK Sengupta2022-05-20 00:26:10
SolutionFrances Martinez2021-07-12 06:21:59
re(2): solutionCharlie2021-06-22 17:58:52
re: solutionKenny M2021-06-22 16:50:47
SolutionsolutionCharlie2021-06-22 10:42:59
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 (5)
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