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

Home > Just Math
Shiny Numbers (Posted on 2013-06-20) Difficulty: 3 of 5
A positive integer is called shiny if it can be written as the sum of two not necessarily distinct integers a and b which have the same sum of their digits. For instance, 2012 is shiny, because 2012 = 2005 + 7, and both 2005 and 7 have the same sum of their digits. Find all positive integers which are not shiny (the dark integers).

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsSome thoughtsbroll2013-06-22 07:10:02
First steps to proofJer2013-06-21 10:05:40
re: Why?...a formal proof is a challengebrianjn2013-06-21 05:03:37
QuestionWhy?...a formal proof is a challengeAdy TZIDON2013-06-21 04:37:31
based on a patternCharlie2013-06-21 01:22:27
It would seem ....brianjn2013-06-20 23:33:45
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 (6)
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