Question 10
In the following cryptarithm, all different letters stand for different digits. Find the product of A and B.
$$\overline{AB}\times B=\overline{AA9}.$$
Each letter is one base-ten digit; different letters have different digits, and leading digits A and B are nonzero.

$$\overline{AB}\times B=\overline{AA9}.$$
Each letter is one base-ten digit; different letters have different digits, and leading digits A and B are nonzero.
