Dissecting the monster: (2016)

Calculus Level 5

The number 2016 is to be dissected into some parts so that the product of the parts is maximized. If the number of such parts be ϕ \phi , then find its value.

Details and Assumptions:

While evaluating ϕ \phi you might come across one or more than one, integer or non-integer answers, thus, choose the nearest integer.


The answer is 742.

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.

2 solutions

Michael Mendrin
Aug 4, 2016

For ϕ \phi from 45 45 to 2016 2016 , the value of

log ϕ 2016 \large \lfloor \log_{\phi}{2016} \rfloor

is 1 1 . So, it's a pretty good bet that the answer is 1 1 .

Oh! Didn't notice that. This made the question absolutely trivial

Vatsalya Tandon - 4 years, 10 months ago

Any methods to change the question so that the answer remains the same?

Vatsalya Tandon - 4 years, 10 months ago

Log in to reply

Let me think about how we can keep the answer of "1" and make it harder anyway. Hmm.

Michael Mendrin - 4 years, 10 months ago

Log in to reply

I think you could just ask for the value of ϕ \phi , instead of your logarithm, just submit a report to your own problem to request the staffs to change the answer.

Pi Han Goh - 4 years, 10 months ago
Vatsalya Tandon
Aug 4, 2016

Let x 1 + x 2 + x 3 + x 4 + + x n = 2016 x_{1} + x_{2} + x_{3} + x_{4} + \cdots + x_{n} = 2016

Using, A M G M AM \geq GM

x 1 + x 2 + x 3 + x 4 + + x n n ( x 1 x 2 x 3 x 4 x n ) 1 n \frac{x_{1} + x_{2} + x_{3} + x_{4} + \cdots + x_{n}}{n} \geq (x_{1}x_{2}x_{3}x_{4} \cdots x_{n})^{\frac{1}{n}}

x 1 x 2 x 3 x 4 x n ( x 1 + x 2 + x 3 + x 4 + + x n n ) n \large x_{1}x_{2}x_{3}x_{4} \cdots x_{n} \leq (\frac{x_{1} + x_{2} + x_{3} + x_{4} + \cdots + x_{n}}{n})^{n}

Thus, we see that maximum value of x 1 x 2 x 3 x 4 x n \large x_{1}x_{2}x_{3}x_{4} \cdots x_{n} is obtained at, x 1 = x 2 = x 3 = x 4 = = x n x_{1} = x_{2} = x_{3} = x_{4} = \cdots = x_{n}

But, here we notice that, ( x 1 + x 2 + x 3 + x 4 + + x n n ) n \large (\frac{x_{1} + x_{2} + x_{3} + x_{4} + \cdots + x_{n}}{n})^{n} is a discrete function of n n .

To arrive at some possible neighbourhood, first we need to make it a continuous function.

Thus by changing the variable from n n to x x .

f ( x ) = ( 2016 x ) x f(x) = (\frac{2016}{x})^{x}

f ( x ) = 0 f'(x) = 0

( 2016 x ) x . l o g ( 2016 x ) 1 = 0 \therefore (\frac{2016}{x})^{x} . {log(\frac{2016}{x}) - 1} = 0

x = 2016 e x = \frac{2016}{e}

Thus the nearest integer comes out to be: 742 \boxed{742}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...