Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Author(s): G. Polya
Source: The American Mathematical Monthly, Vol. 57, No. 1 (Jan., 1950), pp. 26-28
Published by: Mathematical Association of America
Stable URL: http://www.jstor.org/stable/2305170
Accessed: 11-12-2015 11:08 UTC
Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://www.jstor.org/page/
info/about/policies/terms.jsp
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content
in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship.
For more information about JSTOR, please contact support@jstor.org.
Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to The American
Mathematical Monthly.
http://www.jstor.org
This content downloaded from 134.121.47.100 on Fri, 11 Dec 2015 11:08:36 UTC
All use subject to JSTOR Terms and Conditions
MATHEMATICAL NOTES
EDITED BY E. F. BECKENBACH, Los Angeles
of California,
University
Materialforthisdepartmentshouldbe sentdirectto E. F. Beckenbach,
University
of
Los Angeles24, California.
California,
but we know nothingelse about the value of x. In such a case, we should take
forx the approximatevalue 9.9; then we can be certain that the relativeerror
cannot exceed 10% and this is the best we can get. The followinglines explain
this example and prove the underlyingtheorem.
About an otherwiseunknownquantity x we have just one piece of definite
information:we know that x is contained between two given positive bounds a
and b,
(1) a < x? b,
where
(2) 0 <a < b.
minm axIp-xI)
P x
This content downloaded from 134.121.47.100 on Fri, 11 Dec 2015 11:08:36 UTC
All use subject to JSTOR Terms and Conditions
1950] MATHEMATICALNOTES 27
a+b b-a
p= - Y minmax I p-x XI = -x
2 p x 2
The solution of problem II is a little less obvious and may be new, but is
certainlyvery little known:
2ab I. |-x|I b- a
p= }~Y min maxI-
aa+b v x x b+a
We can state the second result in words as follows: The approximationthat
yieldstheminimumfor thegreatestpossibleabsolutevalue oftherelativeerror,com-
mittedin approximatingan unknownquantitycontainedbetweentwoknownposi-
tivebounds,is theharmonicmean ofthesebounds.
In both problemswe can findthe desiredp by the same prescription:Choose
p so that the errors(relative errors) committedin the two extremeadmissible
cases, x=a and x=b, are equal in amount, but opposite&insign. This yields
(3) p-a =-(p-b), p =(a + b)/2, p-a =(a + b)/2,
() p-a p-b 2ab p-a b-a
(4) = _ p = ~ _, = ~
a b aa+b a b+a
in problemsI and II, respectively.Following this prescription,we are bound to
obtain the best possible values, by virtueof a classical theoremof Tchebischeff.1
Our problems are so simple, however,that the result can be proved inde-
pendentlyof any special knowledge.I give the proofforthe solution of the less
obvious problem II.
We regard the approximatevalue p as chosen.We focusour attentionon the
more interestingcase in whicha < p ? b. The absolute value of the relative error
depends on x:
This content downloaded from 134.121.47.100 on Fri, 11 Dec 2015 11:08:36 UTC
All use subject to JSTOR Terms and Conditions
28 MATHEMATICALNOTES [January,
(7) -max
jp-x >
b- a
x x b+a
It happens only in the case (4) that (7) goes over into an equation. This proves
our theoremin the case in which the value of p lies between a and b. The two
remaining (a priori unplausible) cases, p <a and p>b, can be discussed even
more simply.
(1)
fn(al) ... , ?0-lx
X A, ak+i, ak+2, . = 0
and
(2) min(al, a k, ak+1, ak+2, . . ) + 1n; fn(al, a*e? , ak+,, ak+2, . )
; max (al, ** , ak, ak+1, ak+2, . . . ) + *n
(Ax***A,
+ fn ak+1, ak+2, )-A,
hence(1) impliesthat
This content downloaded from 134.121.47.100 on Fri, 11 Dec 2015 11:08:36 UTC
All use subject to JSTOR Terms and Conditions