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

Home > Numbers
Sequence containing itself (Posted on 2014-05-14) Difficulty: 1 of 5
The sequence is the sum of the digits of n.

Most terms of the sequence are 1 more than the previous term but some are not. The first two are shown in bold above.

Create the sequence of terms of A007953 that are not 1 more than the previous term.

Prove or disprove: This new sequence is the same as the original sequence.

No Solution Yet Submitted by Jer    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
sketch of proof Comment 1 of 1
Consecutive numbers in this sequence can only decrease when the ones digit goes from 9 to 0, and they will always decrease when this happens.

The sum of digits after the decrease, then, is for a number whose last digit is zero, and the series is for all such numbers.

Since the final digit of the numbers in this series is 0, it contributes, well, 0 to the sum of the digits, so all of the numbers in the sequence can be divided by 10 without changing the sums. But dividing every 10th number by 10 gives back the sequence 1..n itself, and so the sum of digits of this series is the same as the original.

  Posted by Paul on 2014-05-14 22:44:11
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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