This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
@Pi Han Goh
–
\mbox{digits} works just as well as \text{digits}, but is perhaps less memorable! The one to be careful with is \mathrm. If you \mathrm{use that one}, you
losethespaces,
since LaTeX ignores all spacing in mathematical typesetting, and \mathrm just forces an upright font, without switching out of Maths mode.
You don't have to appeal to LTE. If N(x,n) is the number obtained by concatenating the number x a total of n times, so that N(12,3)=121212, then
N(x,3)=(102k+10k+1)x
for any k-digit number x. Since the sum of the digits of 102k+10k+1 is 3, it contains exactly one factor of 3, and so the exponent of 3 in N(x,3) is one more than the exponent of 3 in x. Since
N(3,3n+1)=N(N(3,3n),3)
an inductive argument finishes things off nicely.
The divisibility theory states that for any number to be divisible for 3, the sum of its digits must be divisible by 3.
Similarly, for any number to be divisible for 32, the sum of its digits must be divisible by 32 and so on.
for any number to be divisible for 3n, the sum of its digits must be divisible by 3n
for divisibility by 33,
Consider any random number.
Let it be 2457396234. Sum of its digits is 2+4+5+7+3+9+6+2+3+4=45
Hence it is not divisible by 27 as 45 is not divisible by 27.
But is is divisible by 9, as 45 is divisible by 9.
It leaves a remainder of 9 when divided by 27 with a quotient of 91014675.
It leaves a remainder of 0 when divided by 9 with a quotient of 273044026.
So the sum of the digits of the number in the question is 3∗32013=32014
The case for n=1 and 2 are true, but it is not true for n = 3. For instance, 27 is obviously divisible by 27 but 2+7=9 is not divisible by 27. That is why your answer is wrong.
Another way of writing this down. Let xn represent the number that when written in decimal representation is a string of 3n digits 1s only. We can see that xn=(102(3n−1)+103n−1+1)xn−1. Therefore, it can be proved that xn=∏k=0n−1(102(3k−1)+103k−1+1). Each factor of this product is divisible by 3 but not by 32. Therefore the highest power of 3 that is a factor of xn is 3n.. The number of the question is equal to 3x2013. That is why the highest power of 3 that divides this number is 32014.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
The expression equals to 33…3=31(99…9)=31(1032013−1)
We want to evaluate
vp(31(1032013−1))=−1+vp(1032013−1)
With p=3,n=32013,x=10,y=−1, we have
−1+v3(10+(−1))+v3(32013)=−1+2+2013=2014
Hope I'm right, I'm still very new to Lifting The Exponent
Side question: How do you set on LaTeX to show that underneath 33…3, it has 32013 digits?
Log in to reply
\underbrace{333...3}_{3^{2013}\ digits} gives 32013 digits333...3
EDIT: Also, 2014 is correct. I sat this exam last week.
Log in to reply
\text{digits} gives digits, which allows you to have 'words' within a mathematical statement, so that it does't appear in italic.
\underbrace{333 \ldots 3} _ {3^{2013} \text{ digits} } gives 32013 digits333…3.
Log in to reply
gazillion timesTHANKYOUTHANKYOU…THANKYOU
Log in to reply
losethespaces, since LaTeX ignores all spacing in mathematical typesetting, and \mathrm just forces an upright font, without switching out of Maths mode.
\mbox{digits} works just as well as \text{digits}, but is perhaps less memorable! The one to be careful with is \mathrm. If you \mathrm{use that one}, youLog in to reply
Thank you Sir Mark Hennings ,You′reAωesome!
You don't have to appeal to LTE. If N(x,n) is the number obtained by concatenating the number x a total of n times, so that N(12,3)=121212, then N(x,3)=(102k+10k+1)x for any k-digit number x. Since the sum of the digits of 102k+10k+1 is 3, it contains exactly one factor of 3, and so the exponent of 3 in N(x,3) is one more than the exponent of 3 in x. Since N(3,3n+1)=N(N(3,3n),3) an inductive argument finishes things off nicely.
The ans is 32014
The divisibility theory states that for any number to be divisible for 3, the sum of its digits must be divisible by 3. Similarly, for any number to be divisible for 32, the sum of its digits must be divisible by 32 and so on.
for any number to be divisible for 3n, the sum of its digits must be divisible by 3n
for divisibility by 33, Consider any random number.
Let it be 2457396234. Sum of its digits is 2+4+5+7+3+9+6+2+3+4=45 Hence it is not divisible by 27 as 45 is not divisible by 27. But is is divisible by 9, as 45 is divisible by 9.
It leaves a remainder of 9 when divided by 27 with a quotient of 91014675.
It leaves a remainder of 0 when divided by 9 with a quotient of 273044026.
So the sum of the digits of the number in the question is 3∗32013=32014
hence it is divisible by 32014.
Log in to reply
The case for n=1 and 2 are true, but it is not true for n = 3. For instance, 27 is obviously divisible by 27 but 2+7=9 is not divisible by 27. That is why your answer is wrong.
Another way of writing this down. Let xn represent the number that when written in decimal representation is a string of 3n digits 1s only. We can see that xn=(102(3n−1)+103n−1+1)xn−1. Therefore, it can be proved that xn=∏k=0n−1(102(3k−1)+103k−1+1). Each factor of this product is divisible by 3 but not by 32. Therefore the highest power of 3 that is a factor of xn is 3n.. The number of the question is equal to 3x2013. That is why the highest power of 3 that divides this number is 32014.