If all four equations are satisfied, then multiplying all four equations together will produce another valid equation. We obtain:

a⁷ × b⁶ × c⁵ × d⁴ × e³ × f² × g = 2,677,277,333,530,800,000.

The number on the right factors into prime powers as 2,677,277,333,530,800,000 = 2⁷ × 3⁶ × 5⁵ × 7⁴ × 11³ × 13² × 17, as can be determined by trial division by the small primes 2, 3, 5, 7, 11, 13, and 17, for instance. So we have the new equation:

a⁷ × b⁶ × c⁵ × d⁴ × e³ × f² × g = 2⁷ × 3⁶ × 5⁵ × 7⁴ × 11³ × 13² × 17.

If p is any prime dividing a, then p⁷ divides the right hand side. Since only 2 appears to the seventh power, the only value p can take is 2. Since a must be greater than 1, we see that 2 must divide a. Because 2 appears to exactly the seventh power on the right, we see that a = 2. Canceling a⁷ on the left with 2⁷ on the right leaves:

b⁶ × c⁵ × d⁴ × e³ × f² × g = 3⁶ × 5⁵ × 7⁴ × 11³ × 13² × 17.

Repeating the same argument shows that b = 3, c = 5, d = 7, e = 11, f = 13, g = 17 is the unique solution to the new equation. However, it is still necessary that these values actually satisfy the original four equations, which in fact they do as can be checked easily. (To see why this last step is necessary, try using the same reasoning on the equations: x = 10, y² = 9, z³ = 25, which clearly has no solutions in integers.)