The correct option is C The predecessor is a multiple of 3.
Let the mystery number be "k".
⟹Successor of ′k′=k+1⟹Sum of the number and its successor=k+(k+1) =2k+1
Now, the lowest odd prime number is 3.
Hence, the sum of the three numbers is a multiple of 3.
So, for an integer "N", we have:
k+(k+1)+(2k+1)=3×N ⟹4k+2=3N
Now, we know that "4k + 2" is a three-digit number.
So, we take:
Hundreds digit of (4k+2)=aTens digit of (4k+2)=bOnes digit of (4k+2)=c
⟹4k+2=(100×a)+(10×b)+c =99a+9b+a+b+c
Now, as "4k + 2" is a multiple of 3, the sum of its digits will also be a multiple of 3.
So, for an integer M, we have:
⟹a+b+c=3×M
⟹4k+2=99a+9b+3×M⟹3k+(k+2)=3(33a+3b+M)⟹k+2=3(33a+3b+M–k)⟹k+2 is a multiple of 3.
Now, the predecessor of "k" is "k – 1".
k–1=(k+2)–3 =3(33a+3b+M–k)+3 =3(33a+3b+M–k+1) ⟹(k–1) is a multiple of 3
Hence, the predecessor of the unknown number is a multiple of 3.