Home > Just Math
Trunk numbers (Posted on 2021-01-04) |
|
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)
Comments: (
You must be logged in to post comments.)
|
Subject |
Author |
Date |
| No Subject | jonesRebecca | 2021-02-19 01:57:07 |
| Solution | Jer | 2021-01-04 14:10:22 |
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|