GO ON BOB
From Math Puzzle Wiki
Revision as of 06:50, 4 May 2010 by 199.120.19.229 (talk)
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.
