Solveeit Logo

Question

Question: Let X be a two digit number such that both X and X2 end with the same digit and none of the digits i...

Let X be a two digit number such that both X and X2 end with the same digit and none of the digits in X equals zero. When the digits of X are written in the reverse order, the square of the new number so obtained has last digit as 6 and is less than 3000. Then the number of distinct possibilities for X is given by

A

1

B

2

C

3

D

4

Answer

3

Explanation

Solution

Let XX be a two-digit number represented as 10a+b10a + b, where aa is the tens digit and bb is the units digit. The problem states that a,b{1,2,,9}a, b \in \{1, 2, \dots, 9\}.

Condition 1: XX and X2X^2 end with the same digit. The last digit of XX is bb. The last digit of X2X^2 is the last digit of b2b^2. This implies bb2(mod10)b \equiv b^2 \pmod{10}. Checking values for b{1,2,,9}b \in \{1, 2, \dots, 9\}:

  • 12=1    11(mod10)1^2 = 1 \implies 1 \equiv 1 \pmod{10} (Valid)
  • 52=25    55(mod10)5^2 = 25 \implies 5 \equiv 5 \pmod{10} (Valid)
  • 62=36    66(mod10)6^2 = 36 \implies 6 \equiv 6 \pmod{10} (Valid) Thus, possible values for bb are {1,5,6}\{1, 5, 6\}.

Condition 2: Let YY be the number obtained by reversing the digits of XX, so Y=10b+aY = 10b + a. Y2Y^2 ends with 6 and Y2<3000Y^2 < 3000. The last digit of YY is aa. The last digit of Y2Y^2 is the last digit of a2a^2. This implies a26(mod10)a^2 \equiv 6 \pmod{10}. Checking values for a{1,2,,9}a \in \{1, 2, \dots, 9\}:

  • 42=16    46(mod10)4^2 = 16 \implies 4 \equiv 6 \pmod{10} (Valid)
  • 62=36    66(mod10)6^2 = 36 \implies 6 \equiv 6 \pmod{10} (Valid) Thus, possible values for aa are {4,6}\{4, 6\}.

Now we combine the possible values for aa and bb and check the condition Y2<3000Y^2 < 3000.

Case 1: a=4a=4

  • If b=1b=1: X=41X = 41. Y=14Y = 14. Y2=142=196Y^2 = 14^2 = 196. Since 196<3000196 < 3000, X=41X=41 is a valid possibility.
  • If b=5b=5: X=45X = 45. Y=54Y = 54. Y2=542=2916Y^2 = 54^2 = 2916. Since 2916<30002916 < 3000, X=45X=45 is a valid possibility.
  • If b=6b=6: X=46X = 46. Y=64Y = 64. Y2=642=4096Y^2 = 64^2 = 4096. Since 409630004096 \not< 3000, X=46X=46 is not valid.

Case 2: a=6a=6

  • If b=1b=1: X=61X = 61. Y=16Y = 16. Y2=162=256Y^2 = 16^2 = 256. Since 256<3000256 < 3000, X=61X=61 is a valid possibility.
  • If b=5b=5: X=65X = 65. Y=56Y = 56. Y2=562=3136Y^2 = 56^2 = 3136. Since 313630003136 \not< 3000, X=65X=65 is not valid.
  • If b=6b=6: X=66X = 66. Y=66Y = 66. Y2=662=4356Y^2 = 66^2 = 4356. Since 435630004356 \not< 3000, X=66X=66 is not valid.

The distinct valid possibilities for XX are 41, 45, and 61. Therefore, the number of distinct possibilities for XX is 3.