# Brilliant question

Let A be a number with 2001 digits such that A is a multiple of 10! Let B be the digit sum of A, C be the digit sum of B, and D be the digit sum of C. What is the unit’s digit of D?

Note by Alpha Beta
4 years, 11 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Let $$S(n)$$ denote the sum of the digits of $$n$$. Since $$A$$ has $$2001$$ digits, $$B = S(A) \le 9 \cdot 2001 = 18009$$.

Since $$B$$ has at most $$5$$ digits, $$C = S(B) \le 9 \cdot 5 = 45$$. By inspection, $$D = S(C) \le 3 + 9 = 12$$.

Since $$S(n) \equiv n \pmod{9}$$ for any integer $$n$$, we have $$D \equiv C \equiv B \equiv A \equiv 10! \cdot m \equiv 0 \pmod{9}$$.

Trivially, $$D \ge 1$$. Since $$1 \le D \le 12$$ and $$D \equiv 0 \pmod{9}$$, we have $$D = 9$$, and thus, the unit digit is $$9$$.

- 4 years, 11 months ago

Awesome buddy.THNX

- 4 years, 11 months ago