If a prime p divides a, then p|b4 and hence p | b.
This implies that p|c4 and hence p | c. Thus every prime dividing a also divides b and c.
By symmetry, this is true for b and c as well. We conclude that a, b, c have the same set of prime divisors.
Let px||a,py||b and pz||c. (Here we write px||a to mean px|a and px+1|/a.) We may assume min {x, y, z} = x.
Now, b|c4 implies that y≤4z;c|a4 implies that z≤4x. We obtain y≤4z≤16x
Thus x+y+z≤x+4x+16x=21x.
Hence the maximum power of p that divides abc is x+y+z≤21x.
Since x is the minimum among x,y,z,px divides a, b, c.
∴px divides a + b + c.
→p21x divides (a+bc)21. Since x+y+z≤21x, it follows that px+y+z divides (a+b+c)21.
This is true of any prime p dividing a, b, c.
∴abc divides (a+b+c)21