Difference between revisions of "GO ON BOB"
From Math Puzzle Wiki
Oscarlevin (talk | contribs) |
|||
| 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 20: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.
