Let s ( n ) be the digit sum of n .
d a ( n ) is defined to be the average digit sum of all non-negative integers less than or equal to n that are divisible by a .
d a ( n ) = ⌊ a n ⌋ + 1 1 k = 0 ∑ ⌊ a n ⌋ s ( a k )
Find the maximum number of integers a in a set A = { a 1 , a 2 , a 3 , … , a m } such that d a i ( 1 0 6 − 1 ) = d a j ( 1 0 6 − 1 ) for any 1 ≤ i , j ≤ m and a 1 = 1 .
Other parts
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!
Problem Loading...
Note Loading...
Set Loading...