Not enough information for AM-GM

Calculus Level 5

Let s 1 , , s n s_1, \ldots, s_n , with n n being an integer 1 \geq 1 , be a series of positive real numbers such that

i = 1 n s i = 271. \displaystyle \sum_{i=1}^n s_i = 271.

If the maximum value of

k = 1 n s k = a x b y \displaystyle \prod_{k=1}^n s_k = \dfrac {a^x}{b^y}

where a a and b b are square-free coprime positive integers, and x x and y y being positive integers greater than 1, find a + x + b + y a+x+b+y .

Note: n n is variable.


The answer is 581.

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.

1 solution

Rohith M.Athreya
Apr 8, 2016

we first use AM GM inequality and arrive at a maximum value for expression k = 1 n s k = a x b y \displaystyle \prod_{k=1}^n s_k = \dfrac {a^x}{b^y}

this happens to be ( 271 n ) n (\frac{271}{n})^n

on differentiating, we get l n 271 n = 1 ln\frac{271}{n}=1 to be satisfied

thus n is 100

max value is ( ( 27 1 100 10 0 100 ) ) = e 100 = 27 1 100 1 0 200 ((\frac{271^{100}}{100^{100}})) = e^{100} = \frac{271^{100}}{10^{200}}

thus required answer is 581

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...