An example of an algorithm that will reverse a number is written as such, digit reverse(num), while (num>0) then, digit =num%10. This particular algorithm divides a number by 10 until the original number from the LSD is found.
36
It is 63.
34.
-8
Is this exactly how the problem was written?
There is no such two digit number. If the first digit is x and the second is y, then the number is 10x + y, its digit reverse is 10y + x, and: 10x + y + 8 = 10y + x → 9x + 8 = 9y → 9x + 8 = 18x → 9x = 8 → x = 9/8 BUT x must be a whole number.as x is a digit 1-9. ergo the problem as stated has no solution.
100000 2847239582
find the diagonal method of two digit number and three digit number
27
45
There is no last digit of pi. It is possible to calculate the digits of pi an infinite number of times. The one millionth number is 5.