i) We'll check two cases:
Case 1: $x\ge y$
Then we have:
$$1 = \frac 1x + \frac 2y - \frac 3z \le \frac 3y - \frac 3z$$
$$\frac 13 \le \frac{z-y}{yz}$$
$$3z - 3y \ge yz$$
Obviously $y\le2$, otherwise the inequality wouldn't hold.
If $\fbox{$y=1$}$ we get:
$$1 = \frac 1x + 2 - \frac 3z$$
$$\frac 3z - \frac 1x = 1$$
$$3x - z = zx$$
Obviosuly $z\le2$. plugging all possible values we get $\fbox{$x=z=2$}$.
If $\fbox{$y=2$}$ we get:
$$1 = \frac 1x + 1 - \frac 3z$$
$$\frac 3z = \frac 1x$$
Hence all solutions are: $\fbox{$(k,2,3k); k \in \mathbb{N}$}$
Simular method for $$y\le x$$
ii) Use Garry's hint and note that at at least one of the variables have to be divisible by 3.
iii) The equation is equivalent to:
$$p^x = (y+1)(y^2 - y + 1)$$
Now we have two cases:
**Case 1:**$(y+1, y^2 - y + 1) = 1$
This means that this numbers are coprime and that means that one of them has to be equal to one. Checking both cases yields: $$(p,x,y) = (2,1,1)$$
Case 2:$p$ divides both numbers
Then we have:
$$p\mid y^2 - y + 1 -(y+1) = y(y-2)$$
Since $p\mid y+1$ we get $p\not\mid y$. Hence $p\mid y-2$. Then we have: $p \mid y+1 - y + 2=3 \implies p = 3$
$y=1$ doesn't yield solution and $y=2$ gives us $p=3, x=2$. Now let $y\ge 3$. Obviously $y^2 - y + 1 > y + 1$ for $y>2$ and hence we have:
$$y+1 = 3^n \quad y^2 - y + 1 = 3^m, \quad m>n$$
Now check all possible combinations for y modulo 3 and you'll get a contradiction fairly easy.