Brilliant Cryptarithm

\[\large \overline{BRI}\times\overline{LL}=\overline{IANT} \]

Above shown is a cryptarithm where each letter represents a distinct single digit non-negative integer where \(B,L,I \) are non-zero. How many solutions are there to the cryptarithm above?

×

Problem Loading...

Note Loading...

Set Loading...