Problem #PRU-103882

Problems Methods Algebraic methods Proof by exhaustion Discrete Mathematics Set theory and logic Mathematical logic Puzzles

11–12 2.0

Problem

Find the smallest four-digit number $C E E M$ for which there exists a solution to the rebus $M N + P O R G = C E E M$ . (The same letters correspond to the same numbers, different – different.)

To see the solution register and get verified.