1. Let AB represent the two-digit number formed by the digits A and B. Thus, AB=10A+B.
2. Similarly, let BA represent the two-digit number formed by the digits B and A. Thus, BA=10B+A.
3. The product of these two numbers is given by:
k=(10A+B)(10B+A)
4. Expanding the product, we get:
k=10A⋅10B+10A⋅A+B⋅10B+B⋅A
k=100AB+10A2+10B2+AB
k=101AB+10A2+10B2
5. We are given that k+1 is a multiple of 101. Therefore:
k+1=101AB+10A2+10B2+1
must be divisible by 101.
6. Since 101AB is already divisible by 101, we need:
10A2+10B2+1≡0(mod101)
7. Simplifying, we get:
10A2+10B2≡−1(mod101)
10(A2+B2)≡−1(mod101)
8. Dividing both sides by 10, we get:
A2+B2≡−101(mod101)
Since 10−1≡91(mod101) (because 10⋅91≡1(mod101)), we have:
A2+B2≡−91(mod101)
A2+B2≡10(mod101)
9. We need to find digits A and B (between 0 and 9) such that:
A2+B2=10
10. Checking possible values, we find:
- A=1 and B=3 (since 12+32=1+9=10)
- A=3 and B=1 (since 32+12=9+1=10)
11. Therefore, the possible values for A and B are (1,3) and (3,1).
12. Calculating k for these values:
- For A=1 and B=3:
k=(10⋅1+3)(10⋅3+1)=13⋅31=403
- For A=3 and B=1:
k=(10⋅3+1)(10⋅1+3)=31⋅13=403
Thus, in both cases, we get the same value for k.
The final answer is 403