Let a and b be positive real numbers. If x^2 + y^2<=1 then what is the largest that ax+by can get?
By the Cauchy-Schwartz inequality, we have (x2 + y2)(a2+b2) >= (ax+by)2.
This can be transformed into (ax+by)2 <= (x2 + y2)(a2+b2) <= 1 * (a2+b2) <= (a2+b2). Hence ax + by <= sqrt(a^2 + b^2) and the equality is achieved when there exists ay = bx.
TD
Related MAT University answers
All answers ▸How do you differentiate ln(f(x))? Tricks like these occur commonly in STEP questions (including one I was looking at earlier today).
The inequality x^4 < 8x^2 + 9 is satisfied precisely when...
Find the number of solutions x in [0,2pi) to the equation 7sin x +2(cos x)^2 =5.
We define the digit sum of a non-negative integer to be the sum of its digits. For example, the digit sum of 123 is 1 + 2 + 3 = 6. Let n be a positive integer with n < 10. How many positive integers less than 1000 have digit sum equal to n?