Answer: 97
Well the easiest way to figure that out is to start with the largest double digit prime and work backwards. There are not that many.
Here are all the double digit primes:
11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
The answer is 97 since 79 is also prime. See we did not have to look too far if we start with the largest double digit prime!
97 does not work because 79 is composite.
It is 97. it is largest, because it is the largest double digit prime number.
There is no largest one, as there will always potentially be other pair such that one is the reverse of the other.
97
10?
ininity
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.
1
double (or, on some platforms, long double)
It probably is: 222
4194304 = 222
de
Read 2 numbers. If first is larger than second, display second, else display first. That's for the smallest. For the largest reverse the two. For each of the other two, it's easier to just create a variable, call it largest. Initialize it to a very small number, say -1. As you read each number, compare it to largest. If the number is larger than largest, set largest equal to the number. When you finish each list of numbers, then print largest. Best answer Read 2 numbers. If first is larger than second, display second, else display first. That's for the smallest. For the largest reverse the two. For each of the other two, it's easier to just create a variable, call it largest. Initialize it to a very small number, say -1. As you read each number, compare it to largest. If the number is larger than largest, set largest equal to the number. When you finish each list of numbers, then print largest.