After writing a solution to this problem I focused on product of digits and got the following result. Also I have a challenge also for all those who found this interesting try if you can do it!
Let f10(x) be defined as the product of digits of x when written in base 10 for example f10(279)=2×7×9=126. Then,
i=10n−1∑10nf(i)=45n
Proof:
First, we have to see the following lemma:
LEMMA : ∑n=10q−110qf(n)=45(∑i=10q−210q−1f(i))
Proof:
Let Sn=∑n=10q−110qf(n)
We can remove numbers from 10q−1 to 1111... (q 1′s) as the numbers between have a 0 in them
Similarly we have to remove numbers from 2000... to 2111... (q−1 0′s and 1 ), from 3000... to 3111... (q−1 0′s and 1 ) and so on.
Sn=(1×1×1...×1)+(1×1×1...×2)...+(9×9×9...×9)
We can take leading digits common, reducing a single digit from each number
Sn=1((1×1...×1)+(1×1...2)...+(9×9...×9))+2((1×1...×1)+(1×1...2)...+(9×9...×9))...9(1×1...×1)+9(1×1...2)...+9(9×9...×9))
Now we can take ∑n=10q−210q−1 by include numbers like 100...01 as f(100...01)=0 so it makes no change
Sn=(n=1∑9)(i=10q−2∑10q−1f(i))=45(i=10q−2∑10q−1f(i))
Using the lemma we can get
i=10n−1∑10nf(i)=45(i=10n−2∑10n−3f(i))
If you apply it again and again
i=10n−1∑10nf(i)=(45)(45)...(i=10n−n∑101f(i))=(45)(45)...(45)=45n
Hence proved
Challenge:
- I have proved this for base 10 you can try for any other base or you may prove it for any base b
#NumberTheory
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
I think your argument can be adapted to any base, b. The sum would be (2b(b−1))n.
The proof could be done by induction. The base case is just the sum of the single digits so S1 equals the (b−1)th triangular number: 2b(b−1).
Assuming Sn=(2b(b−1))n, then by your leading digits argument, Sn+1=1(Sn)+2(Sn)+...+(b−1)(Sn)=2b(b−1)(Sn)=(2b(b−1))(2b(b−1))n=(2b(b−1))n+1, completing the proof by induction.
Log in to reply
Good efforts!
The problem you mentioned is super, and generalising is even more elegant. I need to try solving the problem you linked before studying this note.