Call by s ( n ) the sum of digits of a natural number n .
s ( n ) = 1 0 0 s ( 4 4 n ) = 8 0 0
for some natural number n .
Find s ( 3 n ) .
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.
We will use two important properties:
For N = a n a n − 1 . . . a 0 , we have
S ( N 1 + N 2 ) ≤ S ( N 1 ) + S ( N 2 ) S ( N 1 N 2 ) ≤ S ( N 1 ) S ( N 2 ) .
By using above two properties and s ( n ) = 1 0 0 , s ( 4 n ) = 8 0 0 ; we have
S ( 3 n ) ≤ 3 S ( n ) = 3 0 0
and
8 0 0 = S ( 1 1 . 3 n + 1 1 n ) ≤ S ( 1 1 . 3 n ) + S ( 1 1 n ) ≤ S ( 1 1 ) S ( 3 n ) + S ( 1 1 ) S ( n ) = 2 S ( 3 n ) + 2 0 0 . ⇒ S ( 3 n ) ≥ 3 0 0 .
Thus, S ( 3 n ) = 3 0 0 .
How can we prove the important properties? What is the idea behind them?
That could be a great addition to a digit sum wiki:)
Log in to reply
Sir, i will add the proof of these properties to wiki.
The question should be s(44n) = 800 and not s(4n) = 800?
Log in to reply
I have edited the question.
Log in to reply
Given that you edited the question, can you update the solution accordingly?
The property s(nm) <= s(n)s(m) means that the wanted n doesn't exist, as 800 = s(4n) <= 4s(n) = 400
Problem Loading...
Note Loading...
Set Loading...
Consider s ( n ) and s ( 2 n ) . Each digit k of n contributes at most 2 k to s ( 2 n ) . Tthis contribution is reduced if 2 k ≥ 1 0 , so that carrying is required. Thus s ( 2 n ) ≤ 2 s ( n ) .
Now consider s ( n ) and s ( 1 1 n ) . Each digit k of n contributes at most 2 k to s ( 1 1 n ) , since it contributes k as part of n , and another k as part of 1 0 n . This contribution is reduced if carrying is required in the columns involving k when n and 1 0 n are added together. Thus s ( 1 1 n ) ≤ 2 s ( n ) .
Hence s ( 4 4 n ) ≤ 2 s ( 4 n ) ≤ 4 s ( 2 n ) ≤ 8 s ( n ) . If we are to have s ( 4 4 n ) = 8 s ( n ) , as in this case, we must have no carrying when doubling n to 2 n , when doubling 2 n to 4 n and when multiplying 4 n by 1 1 . For the first of these conditions to happen, all the digits of n must be taken from 0 , 1 , 2 , 3 , 4 . For the first two of these conditions to occur, all the digits of n must be taken from 0 , 1 , 2 , so that all the digits of 4 n will be one of 0 , 4 , 8 . Thus all three conditions will be true if all the digits of n are either 1 or 0 , or else if no digit 2 is adjacent to any digit except 0 .
Whatever the value of n , since it only contains the digits 0 , 1 , 2 , there is no carrying when calculating 3 n . Thus s ( 3 n ) = 3 s ( n ) = 3 0 0 . This value can be achieved, since the value of n written as 1 0 0 1 s in a row is an example of n where s ( n ) = 1 0 0 .