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, 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: ( You must be logged in to post comments.)
  Subject Author Date
No SubjectjonesRebecca2021-02-19 01:57:07
SolutionSolutionJer2021-01-04 14:10:22
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information