A logic problem by Christopher Boo

Logic Level 2

A B C B C + C \large \begin{matrix} & A & B & C \\ & & B & C \\ + & & & C \\ \hline \\ \ \\ \ \end{matrix}

A A , B B , and C C in the cryptogram above are distinct digits from 1 to 9. What is the largest A B C \overline{ABC} such that the sum is the smallest possible 4-digit number?


The answer is 947.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...