Given $a,b,c,k > 0$, find the maximum of $f(x,y,z)=x^ay^bz^c$ where $x,y,z\in [0,\infty)$ and $x^k+y^k+z^k=1$
The subject is Lagrange multipliers, thus that is what I tried to use, where the gradients are
$$\triangledown f=\begin{pmatrix}ax^{a-1}y^{b}z^{c}\\ bx^{a}y^{b-1}z^{c}\\ cx^{a}y^{b}z^{c-1} \end{pmatrix} $$
and if $g$ is the function of the constraint, then
$$\triangledown g=\begin{pmatrix}kx^{k-1}\\ ky^{k-1}\\ kz^{k-1} \end{pmatrix}$$
but then I'm having troubles finding the actual maximum, as I'm interested in $x,y,z,\lambda$ satisfying
$$ \begin{pmatrix}ax^{a-1}y^{b}z^{c}\\ bx^{a}y^{b-1}z^{c}\\ cx^{a}y^{b}z^{c-1} \end{pmatrix}=\lambda\begin{pmatrix}kx^{k-1}\\ ky^{k-1}\\ kz^{k-1} \end{pmatrix} $$
and ignoring for a second the possibilities of one of the constants being $1$, this gives some equations which really don't seem all that right, as extracting $x$ from the first equality for example gives
$$x=\left(\frac{ay^{b}z^{c}}{\lambda k}\right)^{\frac{a-1}{k-1}}$$
which then setting into the second equality to extract $y$ gives
$$b\left(\frac{ay^{b}z^{c}}{\lambda k}\right)^{\frac{a-1}{k-1}}y^{b-1}z^{c}=\lambda ky^{k-1}$$
where I'm not sure how to even approach extracting $y$, and even if I will be able to seems to convoluted to be able to help me in the future..
Any better approaches to the question?
Just played with it a little and got: $$ \left(\begin{matrix}x^{a}y^{b}z^{c}\\ x^{a}y^{b}z^{c}\\ x^{a}y^{b}z^{c} \end{matrix}\right)=\lambda k\left(\begin{matrix}x^{k}/a\\ y^{k}/b\\ z^{k}/c \end{matrix}\right) $$ Therefore $x^k/a=y^k/b=z^k/c$. By putting it in the constraint, we get $$ 1=x^k+y^k+z^k=(1+b/a+c/a)x^k \\ x=\sqrt[k]{\frac{a}{a+b+c}} $$ and similarly $y=\sqrt[k]{\frac{b}{a+b+c}}$ and $z=\sqrt[k]{\frac{c}{a+b+c}}$.