GO ON BOB: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
Solve this cryptarithmetic (each letter represents a unique digit 0 to 9). GO + ON = BOB, given that BOB is divisible by G. | Solve this cryptarithmetic (each letter represents a unique digit 0 to 9). GO + ON = BOB, given that BOB is divisible by G. | ||
[[Category: Cryptarithmetic]] | [[Category: Cryptarithmetic puzzles]] | ||
[[Category: Number theory]] | [[Category: Number theory]] | ||
Revision as of 19:54, 27 May 2010
Solve this cryptarithmetic (each letter represents a unique digit 0 to 9). GO + ON = BOB, given that BOB is divisible by G.