Suppose, the seed of any positive integer n is defined as follows:
seed(n) = n, if n < 10
= seed(s(n)), otherwise,
where s(n) indicates the sum of digits of n. For example,
seed(7) = 7, seed(248) = seed(2 + 4 + 8) = seed(14) = seed(1 + 4) = seed(5) = 5 etc.
How many positive integers n, such that n < 500, will have seed(n) = 9?
(A)39
(B)72
(C)81
(D)108
(E)55
The OA is E.
Solution approach needed!!
seed(n) = n, if n < 10
= seed(s(n)), otherwise,
where s(n) indicates the sum of digits of n. For example,
seed(7) = 7, seed(248) = seed(2 + 4 + 8) = seed(14) = seed(1 + 4) = seed(5) = 5 etc.
How many positive integers n, such that n < 500, will have seed(n) = 9?
(A)39
(B)72
(C)81
(D)108
(E)55
The OA is E.
Solution approach needed!!
It takes time and effort to explain, so if my comment helped you please press Thanks button 
Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.
"Keep Walking" - Johnny Walker
Just because something is hard doesn't mean you shouldn't try,it means you should just try harder.
"Keep Walking" - Johnny Walker
