All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Trunk numbers (Posted on 2021-01-04) Difficulty: 3 of 5
Consider a positive integer n=a1a2...ak, k≥2. A trunk of n is a number of the form a1a2...at, 1≤t≤k-1. (For example, the number 23 is a trunk of 2351)

By T(n) we denote the sum of all trunks of n and let S(n)=a1+a2+...+ak. Prove that n=S(n)+9T(n)

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution | Comment 1 of 2
We just need to show that for each of the digits in n, the sum S(n)=9T(n) contributes the value of this digit.

Consider the ith decimal digit from the left ai.  The value it contribute to n is ai*10^(k-i)
It contributes ai to the sum of S(n)

The ai contributes only to the trunks of i digits or more (i≤t≤k-1):  
Specifically 
for t=i it contributes ai
for t=i+1 it contributes ai*10
and so on up to the largest trunk where
for t=k-1 it contributes ai*10^(k-1-i)
The total contribution to T(n) is then
ai*(1+10+100+...+10^(k-1-i))

And finally the total contribution to S(n)+9T(n) is
ai+9ai(1+10+100+...+10^(k-1-i)) = ai*10^(k-i)




  Posted by Jer on 2021-01-04 14:10:22
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (17)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information