perplexus.info :: Just Math : Champagnat numbers

Champagnat numbers (Posted on 2018-01-23)

A Champagnat number is equal to the sum of all the digits in a set of consecutive positive integers, one of which is the number itself.
Thus, 42 is a Champagnat number, since 42 is the sum of all of the digits of 39, 40, 41, 42, 43, 44.

Prove that there exist infinitely many Champagnat numbers.

No Solution Yet Submitted by Ady TZIDON

No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)

re: a proof

Comment 2 of 2 |

(In reply to a proof by Charlie)

My guess is the list of non-champagnat numbers is finite.

Not only do they dwindle, but they dwindle fast once you add a couple digits.

Consider 5 digit numbers. Each has a max sod of 9*5=45 so a very weak upper bound is 10000/45=222.22 numbers in any string. Each string then contains at least 4 champ numbers (222/45). Again this is a very weak upper bound.

But if every starting number has to give us 4 champ numbers it would be very unlikely for a number to get missed every time.

For 6 digits the same reasoning gives 100000/54^2=34.29 champ numbers for each string. It would be awful hard for a potential champ to slip through.

Posted by Jer on 2018-01-23 16:01:25

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

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

Chatterbox:


perplexus dot info