An Interesting Problem?

Hexadecimal (base-16) numbers are written using numeric digits 0 0 through 9 9 as well as the letters A A through F F to represent 10 15 10 \rightarrow 15 . Among the first 1000 1000 positive integers, there are n n whose hexadecimal representation contains only numeric digits. What is the sum of the digits of n n ?


Source: 2015 AMC 10A

15 20 14 21 19

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.

1 solution

Vishruth Bharath
Feb 7, 2018

We can see that 1000 1000 is 3 E 8 3E8 in hexadecimal. Using this, we can move forward by constructing numbers that consist of only numeric digits in hexadecimal. The first digit could be 0 , 1 , 2 0,1,2 or 3 3 , and the second two could be any digits from 0 9 0 \Longrightarrow 9 , giving us a total of 4 × 10 × 10 = 400 4 \times 10 \times10 = 400 combinations. However, this number of combinations also includes 000 000 , so the total number of combinations must be subtracted by 1 1 . Thus, there are 399 399 valid n n corresponding to those 399 399 positive integers less than 1000 1000 that consist of only numeric digits. Since we are asked to find the sum of the digits, we can add [ 399 ] 3 + 9 + 9 = 3 + 18 = 21 {[399]} \Rightarrow 3 + 9 + 9 = 3 + 18 = \boxed{21} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...