|
Path: g2news2.google.com!news1.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!nx02.iad01.newshosting.com!newshosting.com!news-out.readnews.com!news-xxxfer.readnews.com!news.glorb.com!news.acm.uiuc.edu!not-for-mail
From: rge11x <rge...@netscape.net>
Newsgroups: sci.math.research
Subject: decomposing rationals
Date: Tue, 23 Feb 2010 17:30:03 +0000 (UTC)
Organization: http://groups.google.com
Lines: 13
Approved: Maarten Bergvelt <be...@math.uiuc.edu>, moderator for sci.math.research
Message-ID: <hm13ar$g2k$1@news.acm.uiuc.edu>
NNTP-Posting-Host: u24.math.uiuc.edu
X-Trace: news.acm.uiuc.edu 1266946203 16468 130.126.108.54 (23 Feb 2010 17:30:03 GMT)
X-Complaints-To: news@acm.uiuc.edu
NNTP-Posting-Date: Tue, 23 Feb 2010 17:30:03 +0000 (UTC)
X-Coding-System: iso-8859-1-unix
X-Sieve: CMU Sieve 2.3
X-Authentication-Warning: yws13.prod.google.com: news set sender to n...@google.com using -f
Originator: be...@math.uiuc.edu (Maarten Bergvelt)
Hello
let x be any rational number, and also given an arbitrary interval [a,
b] that does not contain x. Is there a systematic way to find a set
of integers m1, m2, ..mK and corresponding rationals y1, y2,...yK all
in the interval [a, b] such that their linear combination is x,
x= m1.y1 + m2 . y2 + ....+ mK . yK
and the |m1| + |m2| + ...+ |mK| is minimum?
thank you
| sci.math.research |