Any numbers mod 9 value gives us the recursive sum of its digits for ex: 112 = 1+1+2 = 4 is the sum of digits 112 mod 9 = 4 mod 9 = 4 is the sum of digits Similarly
4444 = 7 mod 9 4444^(4444) = 7^(4444) mod 9 4444^(4444) = 7*7^(3)(1481) mod 9 Since 7^3 mod 9 = 1 mod 9 7*7^(3)(1481) mod 9 = 7*(1)^1481 mod 9 = 7 mod 9 ie., 4444^(4444) = 7 mod 9 ===> 7 is the recursive sum of its digits.
A five digit number has all non-zero different digits & decreasing arranged. Average of all the digits of the numbers is 5. The difference of number and the number formed by reversing the order of digits is 84942.
What would be the sum of all such possible digits - 1) 196052 2) 196002 3) 195984 4) 195842 5) 195802 6) 195798 7) 195602 8) 195588 9) 195512 10)195490
An integer x is selected in such a way that
x + x^(1/2) + x^(1/4) = 276
Then what would be the sum of all digits of the number y where
y = 100000 x^(1/4) + 1000 x^(1/2) + x
