The original number, written as " T U ", has the value (10T + U). When you reverse the digits, the new number has the value (10U + T). Adding the two numbers: (10T + U) + (10U + T) = 55 11T + 11U = 11(T + U) = 55 T + U = 5 All possible two-digit numbers that satisfy (T + U = 5) are: 1423 32 41
whats the answer please??
38
Instead of reading the numbers from left to right (1234) read them from right to left (4321).
An emirp number is a prime number which, when you reverse the digits, produces a different prime number. Therefore, there are no single-digit emirp numbers. The first three emirp numbers are: 13, 17, 31
In the numbers 1-9 each number has 1 digit and there are 9 of them, so that's 9.In 10-99 each number has 2 digits, and there are 90 of them: 2x90 = 180There are 900 three digit numbers [100 through 999]: 2700 digits.There are 9000 four digit numbers: 36000 digits.90,000 numbers with five digits: 450,000 digits.900,000 numbers with six digits: 5,400,000 digits.Then 1 number with seven digits: 7 digits.Add them up and you have 5,888,896 digits.
whats the answer please??
38
Some numbers that you can get when you reverse the digits and they are still prime numbers are: 403 ÷ 13 = 31 2,701 ÷ 37 = 73 1,207 ÷ 17 = 71
Reverse the digits then check of the new number is the same as the original number.
Possibility of two digit no whose sum is 17 89 and 98 Reverse of 89 is 98. 98 is 9 less than the original no 89. 89 is original no
Possibility of two digit no whose sum is 10 19,28,37,46,55,64,73,82,91 Now add 54 to each no mentioned above 73,82,91,100,109,118,127,136,145 See after 1st comma 28 and 82 Reverse of 28 is 82. That no 82 is 54 more than the no 28. So 28 is the original
Instead of reading the numbers from left to right (1234) read them from right to left (4321).
2178 x 4 = 8712
An emirp number is a prime number which, when you reverse the digits, produces a different prime number. Therefore, there are no single-digit emirp numbers. The first three emirp numbers are: 13, 17, 31
Digits is how many numbers you have in a number. If you have the number 4 it has one digit if you have the number 20 it has two digits and if you have the number 558 it has three digits. So basically in the number 1085 it has 4 digits because there is 4 numbers in it, the numbers are 1,0,8 and 5. Hoped you understand.
The most efficient method is to reverse the digits in the number and then check if the reversed number is equal to the original number. In C, we can implement this as follows (using long-hand notation for clarity). Note the use of base (defaulting to base 10) so that we can check values in other bases. bool is_palindrome (unsigned num, unsigned base = 10) { // local variables unsigned rev, digit, digits; // copy the input number digits = num; // initialise the accumulator rev = 0; // repeat while there are digits while (digits) { // extract the low-order digit using modulo (%) operator digit = digit % base; // shift the accumulated digits (if any) one position to the left rev = rev * base; // add on the new digit rev = rev + digit; // shift the remaining digits one position to the right digits = digits / base; } // end while // return true if the number and its reverse are equal return num == rev; }
Armstrong numbers are the sum of their own digits to the power of the number of digits.