f ( x ) = x ! 1 0 3 x , x ∈ N
If the values of x for which f ( x ) is maximum are x 1 , x 2 , … , x n , then find n + j = 1 ∑ n x j .
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.
Pretty easy but damn complex looking question.
Nice solution but please explain me how you got this ?
"f(103) = f(102)"
Log in to reply
f ( x ) = x ! 1 0 3 x = x × ( x − 1 ) ! 1 0 3 × 1 0 3 x − 1 = x 1 0 3 f ( x − 1 )
f ( 1 0 3 ) = 1 0 3 1 0 3 f ( 1 0 2 ) = f ( 1 0 2 )
I also adjusted the solution to include this.
Log in to reply
Oh i should have rather noted that earlier.
Anyways, thanks for your reply. i Understood that.
Problem Loading...
Note Loading...
Set Loading...
It is easy to see, that for x > 1:
f ( x ) = x ! 1 0 3 x = x × ( x − 1 ) ! 1 0 3 × 1 0 3 x − 1 = x 1 0 3 f ( x − 1 )
Now, our discrete f(x) is increasing, when:
f(x - 1) < f(x)
Since f(x) is always positive, this is equivalent to:
1 < f ( x − 1 ) f ( x )
1 < x 1 0 3
x < 1 0 3
We can also find (by substituting x = 103 into our first formula), that:
f ( 1 0 3 ) = 1 0 3 1 0 3 f ( 1 0 2 ) = f ( 1 0 2 )
This means, that f(x) has its maximum at x = 102 and since f(103) = f(102) (and f(x - 1) > f(x) for x > 103 (can be proven by simply exchanging"<" for ">" at our steps above), therefore we have:
2 maximum values at x = 102 and x = 103
Hence, the solution is:
2 + 1 0 2 + 1 0 3 = 2 0 7