A four-digit number N , where the four digits are distinct, is such that if you add its four digits to N , it gives 2 0 0 6 . Find N ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Same exact way - you beat me to it! Bonus question: what if we replace 2 0 0 6 in the question with 2 1 1 1 ?
Log in to reply
Your comment and question just came to my notice. The answer to your question is 2 1 0 4 :)
Where does the problem say that it's four digits are distinct? What about 2 0 0 2 ?
It shouldnt be 2002 so the question asked for distinct digits
Log in to reply
I guess you earlier mentioned that there were distinct digits but the question was modified by Chew-Seong Cheong and he forgot to add the distinct digits part, so when I saw the problem, it wasn't there but he added it afterwards when I asked him about the case N = 2 0 0 2 .
2095 will be N if 2111 is given.
That's the other solution. The point is, both 2 0 9 5 and 2 1 0 4 give the total 2 1 1 1 (and satisfy the criterion that their digits be distinct). So an interesting follow-up question is, which totals have unique solutions? Or, what's the largest possible number of solutions for a particular total?
Let N = A B C D , where A , B , C , and D are single digit integer from 1 to 9 . Then we have:
A B C D + A + B + C + D 1 0 0 1 A + 1 0 1 B + 1 1 C + 2 D 1 9 1 0 + 1 1 C + 2 D 1 1 C + 2 D 8 8 + 2 D 2 D ⟹ D = 2 0 0 6 = 2 0 0 6 = 2 0 0 6 = 9 6 = 9 6 = 8 = 4 Since A 0 0 A + B 0 B < 2 0 0 6 ⟹ A = 1 , B = 9 Putting C = 8
Therefore N = 1 9 8 4 .
What about N = 2 0 0 2 ?
Log in to reply
Oops! I have deleted the digits are distinct in the questions. Sorry.
Ya that's true but the question says distinct digits
Problem Loading...
Note Loading...
Set Loading...
Let a = b = c = d be the thousand's, hundred's, ten's and unit's digits of the number respectively. Then 0 ≤ a , b , c , d ≤ 9 . Also, a must be equal to 1 , since at most one digit can be zero and the number must be as close to 2 0 0 6 as possible. Then from the given condition 1 0 0 1 a + 1 0 1 b + 1 1 c + 2 d = 2 0 0 6 we get b + c + 2 d can be 5 , 1 5 , 2 5 or 3 5 . Also, b must be the largest possible and b + c must be odd. For a = 1 and b = 9 we have 1 0 0 1 + 9 0 9 + 1 1 c + 2 d = 2 0 0 6 ⟹ 1 1 c + 2 d = 9 6 . So c ≤ 8 . Since d ≤ 9 , therefore the only possible values of c and d are 8 and 4 respectively. Therefore the required number is 1 9 8 4 .