You don't say at what "level" in the book this is but to me it cries out for "Lagrange multipliers". You want to maximize f(x,y,z)= x+ y+ z subject to the constraint g(x,y,z)= xyz= 5. The gradient of f is \(\displaystyle \nabla f= <1, 1, 1>\). The gradient of g is \(\displaystyle \nabla g= <yz, xz, xy>\). Where f is a maximum (or minimum), subject to g= 5, those two vectors must be parallel: \(\displaystyle <yz, xz, xy>= \lambda <1, 1, 1>\) for some constant \(\displaystyle \lambda\) (the "Lagrange multiplier"). That is we must have \(\displaystyle yz= \lambda\), \(\displaystyle xz= \lambda\), and \(\displaystyle xy= \lambda\). Since getting a value of \(\displaystyle \lambda\) is not necessary to solving this problem you might find it simplest to first eiminate \(\displaystyle \lambda\) by dividing one equation by another.