Let for any real values of and such that If the number is the smallest possible number such that for all triples satisfying that what can we say about the number ? Justify your answer.
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.
Let a and b be arbitrary positive numbers and α and β two positive numbers such that α + β = 1 . Then the following inequality is always true due to the fact that the natural logarithm has a concave (or concave down) graph: ln ( α a + β b ) > α ln a + β ln b . Evaluating the function y = e x at the expressions that appear in the right side and the left side of the previous inequality, respectively, and using the fact that that function y = e x is increasing, it follows that, α a + β b > a α b β . Dividing both sides by the positive number α a + β b , we get that α a + β b a α b β < 1 . Now, let us assume that x < y < z and make a = F ( x , y ) , b = F ( y , z ) , α = z − x y − x , and β = z − x z − y . Then the following inequality follows z − x y − x F ( x , y ) + z − x z − y F ( y , z ) F ( x , y ) z − x y − x F ( y , z ) z − x z − y < 1 . Using direct computation you can see that the denominator of the fraction in the left side of the previous inequality reduces to F ( x , z ) . Then the previous inequality can be rewritten as F ( x , z ) F ( x , y ) z − x y − x F ( y , z ) z − x z − y < 1 . This inequality proves that k exists and has to be smaller than or equal to 1 . But we can prove that the value of k is exactly 1 by showing that when you fix a value of x and a value of z , such that x < z , and you take the y in between these two values, but making it tend to z, the limit of the left side of the previous inequality is 1. Then k = 1 , and, therefore, the answer is 1 ≤ k < 2 .