Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > MHF Lounge > Problem of the Week
Closed Thread
 
Thread Tools Display Modes
  #16  
Old May 9th, 2009, 08:56 PM
Newbie
 
Join Date: Apr 2009
Posts: 11
Country:
Thanks: 0
Thanked 1 Time in 1 Post
hkito is on a distinguished road
Send a message via AIM to hkito
Default

The minimum is attained at the mean \dfrac{\sum_{i=1}^{16} 2^i}{16}= \dfrac{2^{16}-1}{16}
Advertisement
 
  #17  
Old May 10th, 2009, 01:33 AM
CaptainBlack's Avatar
Grand Panjandrum
 
Join Date: Nov 2005
Location: South of England
Posts: 11,265
Country:
Thanks: 656
Thanked 3,585 Times in 2,887 Posts
CaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond reputeCaptainBlack has a reputation beyond repute
Default

Quote:
Originally Posted by hkito View Post
The minimum is attained at the mean \dfrac{\sum_{i=1}^{16} 2^i}{16}= \dfrac{2^{16}-1}{16}
If you tell us why you think the minimum is attained there and what that minimum is we could explain where you went wrong.

CB
  #18  
Old July 28th, 2009, 12:11 PM
Junior Member
 
Join Date: Jul 2009
Posts: 74
Thanks: 3
Thanked 24 Times in 23 Posts
Krahl is on a distinguished road
Default

This is how i did it...

let S=|x-2|+|x-2^2|+...+|x-2^8|+|x-2^9|+....+|x-2^{15}|+|x-2^{16}|

and S=|x-2^{16}|+....+|x-2^9|+|x-2^8|+.......+|x-2|

so whatever value minimises S would minimise

2S=(|x-2|+|x-2^{16}|)+(|x-2^2|+|x-2^{15}|)
+......+(|x-2^8|+|x-2^9|)+(|x-2^9|+|x-2^8|)+......+(|x-2^{16}|+|x-2|)

So if we look at all the values of x which minimises each term then the intersection of the values of x will minimise 2S and S.

looking at the graph of each term as chisigma did we see that all values between the minimum of each of the two terms are minimising values for both terms. since they are linear functions they intersect in the middle.

so the valuse minimising (|x-2|+|x-2^{16}|) are 2 \leq x \leq 2^{16} and so on.

the intersection of 2 \leq x \leq 2^{16},2^4 \leq x \leq 2^{15},...,2^8 \leq x \leq 2^9,...,2 \leq x \leq 2^{16}

is 2^8 \leq x \leq 2^9 so these values would all minimise S.

Last edited by Krahl; July 28th, 2009 at 01:44 PM.
  #19  
Old August 7th, 2009, 05:45 PM
Banned
 
Join Date: Aug 2009
Posts: 143
Country:
Thanks: 8
Thanked 54 Times in 39 Posts
luobo will become famous soon enough
Default

Problem: Known -\infty<x_1<x_2<...<x_{n-1}<x_n<+\infty, minimize f(x)=\sum_{i=1}^{n} |x-x_i|.

Two observations of f(x) are:
(1) It is uni-modal (for odd n, 1 minimum point) or almost so (for even n, 2 minimum points of equal functional value).
(2) The minimum value can be reached at the nodes x_i, 1\leq i\leq n.

With these observations, suppose minimum is reached at x_k. Then
f(x_k)=\sum_{i=1}^{n} |x_k-x_i|=\sum_{i=1}^{k-1} (x_k-x_i)+\sum_{i=k+1}^{n}(x_i-x_k)=(2k-n-1)x_k+\sum_{i=k+1}^{n} x_i-\sum_{i=1}^{k-1} x_i

Similarly,
f(x_{k-1})=(2k-n-3)x_{k-1}+\sum_{i=k}^{n} x_i-\sum_{i=1}^{k-2} x_i
f(x_{k+1})=(2k-n+1)x_{k+1}+\sum_{i=k+2}^{n} x_i-\sum_{i=1}^{k} x_i

f(x_k)-f(x_{k-1})=(2k-n-2)(x_k-x_{k-1})\leq 0=>2k\leq n+2

f(x_{k+1})-f(x_k)=(2k-n)(x_{k+1}-x_k)\geq 0=>2k\geq n

Therefore, \frac{n}{2}\leq k \leq \frac{n}{2}+1

For the present example, n=16, so k=8 or 9.

Last edited by mr fantastic; September 19th, 2009 at 03:01 AM. Reason: Restored original reply
Closed Thread
Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 06:10 PM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2009, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2009 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.