In both items, the smallest chosen number is at least 2: in part (a), n/2>1 and in part (b), p is a prime. So let 1<x<y<z be the chosen numbers. Then all possible combinations are
x+y+z,x+yz,xy+z,y+zx,(x+y)z,(z+x)y,(x+y)z,xyz.
Since, for 1<m<n and t>1, (m−1)(n−1)≥1⋅2⟹mn>m+n, tn+m−(tm+n)=(t−1)(n−m)>0⟹tn+m>tm+n, and (t+m)n−(t+n)m=t(n−m)>0,
x+y+z<z+xy<y+zx<x+yz
and
(y+z)x<(x+z)y<(x+y)z<xyz.
Also, (y+z)x−(y+zx)=(x−1)y>0⟹(y+z)x>y+zx and (x+z)y−(x+yz)=(y−1)x>0⟹(x+z)y>x+yz. Therefore the only numbers that can be equal are x+yz and (y+z)x. In this case,
x+yz=(y+z)x⟺(y−x)(z−x)=x(x−1).
Now we can solve the items.
a. If n/2<x<y<z then z−x<n/2, and since y−x<z−x, y−x<n/2−1; then
(y−x)(z−x)<2n(2n−1)<x(x−1),
and therefore x+yz<(y+z)x.
b. If x=p, then (y−p)(z−p)=p(p−1). Since y−p<z−p, (y−p)2<(y−p)(z−p)=p(p−1)⟹y−p<p, that is, p does not divide y−p. Then y−p is a divisor d of p−1 and z−p=dp(p−1). Therefore,
x=p,y=p+d,z=p+dp(p−1),
which is a solution for every divisor d of p−1 because
x=p<y=p+d<2p≤p+p⋅dp−1=z.