Real numbers , , and satisfy . Given that is an integer , find the maximum possible that satisfies
for all , , and satisfying the condition previously stated.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
notice that using Chebyshev, it is possible to generalise Nesbitt's inequality. consider the 2 increasing sequences a^n-1 >= b^n-1 >= c^n - 1 and a/b +c >=b/c+a>=a+b . Now use chebyshev and (nesbitt's later) and solve