Let f ( n ) find the sum of the digits of n . Find the value of f ( f ( ( 5 3 8 5 6 2 4 4 0 8 3 + 3 0 2 9 2 2 9 0 9 1 3 ) 3 + ( 7 9 4 5 3 1 7 6 5 5 3 + 3 1 5 1 1 8 1 4 4 3 3 ) 3 ) )
Details and Assumptions
The answer to this question is a one-digit number.
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.
This is no doubt the best solution to this problem. This was exactly the same way in which I approached this problem. And, are you seriously 39? You look a lot younger ( in the photo)
Wow that's awesome! :D
This solution is very similar to mine! However, I kind of find mine a bit flaw-ish because I went with a simple trial and error system, until I noticed the pattern with the 0's and the 1's and came up with something like this.
Can anyone give me tips on what to look out for next time? Perhaps some number properties I could find useful when solving these kinds of problems using modular arithmetics?
Log in to reply
PS: Really well written and explained solution, kudos to you!
As f ( n ) be the sum of the digits n we can easily derived some of the properties of f ( n ) .Like f ( f ( a + b ) ) = f ( f ( a ) ) + f ( f ( b ) ) . To check this property you can put any two integer in place of a&b. Let , consider a=12 &b=15 then f ( f ( a + b ) ) = 9 and also f ( f ( a ) ) + f ( f ( b ) ) = 9 So the property is correct. Another property which I use to solve this one is f ( f ( a 3 + b 3 ) 3 ) = f ( [ f ( a + b ) ] 3 ) . These properties are found by observation. Then consider the given as f [ f ( ( a 3 + b 3 ) 3 + ( c 3 + d 3 ) 3 ) ] . Then break it like f [ f ( a 3 + b 3 ) 3 ] + f [ f ( c 3 + d 3 ) 3 ] and then use the second property which I consider before. You can get the answer 1 + 8 = 9 .
Good solution
Log in to reply
Thanks!!! for your comment
Log in to reply
Welcome. But I really doubt whether you can generalize this for all numbers. I think I must work on them.
Log in to reply
@Krishna Ar – When I solved this one I took so many numbers and observed that all those satisfy these condition . So I generalised it.
Log in to reply
@Arghyanil Dey – Hey, but that is not a proof! You must do it algebraically.
@Arghyanil Dey – BTW, are you giving Jee this year?
Log in to reply
@Krishna Ar – Yes,and you?
Log in to reply
@Arghyanil Dey – Hey! I am just 14! How could I give JEE? And, I won't appear for it anyway...:P
Very nice problem. Bravo!!!!
If a number is divisible by 9, then the sum if its digits is divisible by 9; conversely, if the sum of the digits of a number is divisible by 9, then the number is divisible by 9 (this is a common di visibility test: notice that 1, 10, 100, etc. are all congruent to 1 mod 9, so the sum of the digits of a number base 10 is congruent to the number itself mod 9). Now we notice that each of the four numbers in the expression is divisible by 9, therefore the entire expression inside the inner f(...) is divisible by 9. We apply f twice to that number to get the final answer of 9 - we know the final answer can't be zero (since only zero has a digit sum of zero), so we use the hint to deduce that the answer is 9 and not a greater multiple of 9. (I have no proof that the final answer can't be 18 or greater, unfortunately :( )
Not all of the numbers are multiples of 9 ( like 3029229091, which digit sum is 37 ) Consider my solution
Log in to reply
You are right. This is the another method . I solve it in two ways- obviously this is one of them.
i think you did the best job
I evaluated each expression by hand.I know this sounds stupid but it is the best I could do and I guess I got lucky :)
You must jocking.
Seriously!?! U calculated the cube of 27/28 digit numbers?????
Log in to reply
I'm serious.At school,we just finished our tests so we have free time.When I saw this problem,I copied the numbers down and calculated them at school.
Wow there are better ways to do this...
Problem Loading...
Note Loading...
Set Loading...
5 3 8 5 6 2 4 4 0 8 ≡ 0 ( m o d 9 )
5 3 8 5 6 2 4 4 0 8 3 ≡ 0 ( m o d 9 )
3 0 2 9 2 2 9 0 9 1 ≡ 1 ( m o d 9 )
3 0 2 9 2 2 9 0 9 1 3 ≡ 1 ( m o d 9 )
7 9 4 5 3 1 7 6 5 5 ≡ 7 ( m o d 9 )
7 9 4 5 3 1 7 6 5 5 3 ≡ 3 4 3 ≡ 1 ( m o d 9 )
3 1 5 1 1 8 1 4 4 3 ≡ 4 ( m o d 9 )
3 1 5 1 1 8 1 4 4 3 3 ≡ 6 4 ≡ 1 ( m o d 9 )
Plugging these values back to the question,
( 5 3 8 5 6 2 4 4 0 8 3 + 3 0 2 9 2 2 9 0 9 1 3 ) 3 + ( 7 9 4 5 3 1 7 6 5 5 3 + 3 1 5 1 1 8 1 4 4 3 3 ) 3
≡ ( 0 + 1 ) 3 + ( 1 + 1 ) 3 ( m o d 9 )
≡ 1 + 8 ( m o d 9 )
≡ 9 ( m o d 9 )
≡ 0 ( m o d 9 ) Therefore, that number ( which I am too lazy to copy and paste it) is a multiple of 9. So, the digit sum of it must be a multiple of 9. Since the hint said that it was a one-digit number, the answer is 9. It can't be zero or else the number itself will be zero.