Find the sum of digits of the least positive integer such that the inequality above holds for every positive integer .
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.
Denote f ( n ) = n + 1 1 + n + 2 1 + ⋯ + 2 n + 1 1 and observe that f ( n ) > f ( n + 1 ) for all positive n. Indeed,
f ( n ) − f ( n + 1 ) = n + 1 1 − 2 n + 2 1 − 2 n + 3 1 = 2 n + 2 1 − 2 n + 3 1 > 0 .
This shows that f attains its maximum at n = 1 . Therefore, suffice it to consider the inequality f ( 1 ) < a − 2 0 1 4 7 1 , i.e.,
2 1 + 3 1 < a − 2 0 1 4 7 1 . From here a satisfies a > 2 0 1 4 + 6 5 + 7 1 = 2 0 1 4 4 2 4 1 . Obviously a = 2 0 1 5 is the least integer that satisfies this inequality.