Can you crack RMO??

Algebra Level 3

For any natural number "n",let S(n) denote the sum of digits of "n".Find all the 3 digit number such that S(S(n))=2

100 157 259 251

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.

2 solutions

Abhishek Sahoo
Jun 3, 2015

Sorry Gupta sahab

@Mohit Gupta I know you are quiet busy but can you please explain how to solve this

sakshi rathore - 5 years, 12 months ago
Daksh Mor
Sep 25, 2020

yes i can crack RMO , lol

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...