Let x,y,z be three distinct positive integers satisfying the given conditions.
We may assume that x<y<z.
Thus we have three relations:
1y+1z=ax,1z+1x=by=cz
for some positive integers a,b,c.
Thus 1x+1y+1z=a+1x=b+1y=c+1z=r,
say.
Since x<y<z, we observe that a<b<c.
We also get 1x=ra+1, 1y=rb+1, 1z=rc+1
Adding these, we obtain r=1x+1y+1z=ra+1+rb+1+rc=1,
or 1a+1+1b+1+1c+1=1.............(1)
Using a<b<c, we get
1=1a+1+1b+1+1c+1<3a+1
Thus a<2.
We conclude that a=1.
Putting this in the relation (1), we get 1b+1+1c+1=1−12=12
Hence b<c gives 12<2b+1
Thus b+1<4 or b<3. since b>a=1,we must have b=2.
This gives 1c+1=12−13=16,
or c=5.
Thus x:y:z=a+1;b+1;c+1=2:3:6.
Thus the required numbers with the least sum are 2,3,6