Professional Documents
Culture Documents
2, the
number F,41 of pairs extant during the (n+ 1)th month will include the
Fy pairs alive in the previous month plus the offspring of the Fy-1 pairs
sho were alive two months before. Thus, Fy satisfies the recursion relation
Aah
Fog = Fat Fan (n
3,4,36 1, Fundamentals
We can answer Fibonacci’s question by computing each F, in turn:
1,1,2,3,5,8, 18,21, 34,55, 89, 144, 233,377,610, ...
‘The number of pairs present at the beginning of the 13th month is Fis =
233, so that after one year, the original pair is responsible for the production
of 232 new ones.
We will look at the question of finding a general formulae for the terms
of the sequence in Exploration E.50. Our interest here is to construct a
polynomial of two variables whose positive values are precisely the numbers
Fa where n is a positive integer.
(a) Show that for each value of n exceeding 1
oe een
eS leeiita
(b) Let z and y be positive integers such that
odd.
FaiFao —
(»)
It can be shown that y—2, 2, y are consecutive terms in the Fibonacci
sequence, First note that < y and yz 0, ab <0, ac <0, we can choose u= B,v=B+C=
[Solution by Gary Baumgartner]
Second solution. Assume that. abe # 0, and let there be a solution
(z,y,2) = (cosu,cos v,cos w), where 0 < u,v,w < x. Then, for each 0,
wwe have that
abcos(u ~ v).
a.cos(u +9) + beos(v +6) + ccos(w +0)
= cos O(acos w+ 8008 v-+ coos)
+ sinO(asinu + bsinv + esinw) =0.
‘Taking @ = —u yields a = ~beos(v—u)~ecos(w—u), whence [a| < [bl+lel
Similarly, |b] < Ja|+lel and [el < la]+[b]. The rest can be treated as before
28. Yes. Since there are five odd powers of z, the second player can guar-
antee that after the first player has completed four moves, there is a coefli-
cient of one of these powers which has not been assigned. When he comes
to make his fourth move, he finds that the polynomial f(z) has the form
g(z) + a2" +bz* where g(x) is determined, r is odd and a,b have yet to be
sclected. If s is even, he notes that, since f(1)-+f(—1) = 9(1)+9(—l) +2
does not depend on a, he can choose b in such a way that f(1)+J(—1) = 0.Solutions to Problems; Chapter 8 381
Since this guarantees that either 1 is a zero or f(1) and {(—1) have oppo-
site signs, he can win regardless of the last move of the first player. If s is
‘odd, he needs to take a little more care. In this case, he notes that
2 F(1) + F(—2) = 291) + 9(—2) + (2 — 2").
‘Again, he can choose 6 to ensure that this quantity vanishes regardless of
the first player’s last move and thus, as before, ensure a win.
29, For the case m 4, the strategy is to raise AX — BY toa
sufficiently high power that. A‘ or B* is a factor of each term. Thus,
1 (AX — BY)" = AN(A®XT — TAPBXSY 4 D1AB*X*Y? — 35B9X4Y9)
— BABY? — TAB? XY* + 21A7BX7Y® — 54°XPY4),
‘The choice of u and v is clear. For general m, n, look at 1 = (AX —
Byynte=1
30. Let g(x) = p(z) + (2) +--+ + p™(z2), Then q(z) is a polynomial
of even degree with positive leading coefficient. Suppose q(z) assumes its
minimum value when z = u. Then 0 = ¢(u) = 9(u) ~ p(u). But then
(2) > a(t) = p(u) 0 for all x (cf. Problem 5.4.22).
31. Suppose a < b < e. Let f(t) = (t— 2)(t— y)(t — 2) and a(t) =
(ta)(t—8)(t—e). Since f(c) > 0 = g(c) and f(a) < 0 = g(a), there exists
some point w in the interval [a,¢] for which f(u) = g(u). This implies that
(ey +22 + yz — ab — ac —bc)u = 0. Since u > a > 0, it follows that
zy-+ 22+ yz = ab-+ac-tbc and f(t) = g(t) identically. The result follows,
For other solutions, see Amer. Math. Monthly 72 (1965), 185-186.
32. Let n be a given integer. We can write the given polynomial in the
form p(2) = k[](2— 1). Let
az) = 2? [] (ert + ria + Pet Pm),
‘Then p(z)q(z) = k2” [](2" — rf). We obtain the result by taking n =
1000 000. [Solution by M.S. Klamkin,]
33. Suppose that the degree of p(z) is m and that of q(z) is n where
m > n. If the distinct zeros of p(z) and (z) are ty, u2,...;Ue and the
zeros of p(z)—1 and q(z)—1 are v1,v2,-.., 0s, then the u and the vy are
distinct zeros of the difference (p—q)(2). If we can show that r+ > m >
deg(p — 9)(2), the result will follow.
Now, the common derivative of p(z) and p(z)— 1 has at least (m~r) +
(ms) zeros counting multiplicity, 80 that 2m—r—s < deg p/(z) =
whencer-+s>m+I>m |382 Answers to Exercises and Solutions to Problems
94, The system
p+qtr=0
up+oq+ur=0 *)
ep+mter=0
in the variables p, g, r has a nontrivial solution
(p.ar) =(y- 2,2 -2,2-y)-
Since 23 +u3 = y?+0%, it follows that uy —vz # 0 (otherwise 2 = ky and
w= ku), Hence, we can solve the system bu+ cz = bu-+ cy = 1 for b and c.
Mulpting the equation (x) respectively by 1, by ~e and adding yields
= (1~ bw c2)(z—y), whence bw + ¢
From (—cz)® = (bu—1)® and —2?
equation
8, ete., we find that the
(= By + 384? — 38 + (1-284) = 0
has (unequal) roots u, v, w, so that (6% — e®)unw = 1 ~ a%®. Similarly,
wo e)t243e2?—Bct-+(1—a88) = 0 hgs roots 2, y, 2,50 that (b°—<3)zy,
8 — 1. Hence
(®— )(uow + zyz) = a(6° — 9),
Since each of the two cubic equations has three roots and since 6 and ¢
cannot both be zero, at least one of the eubie equations is nontrivial and
B—F £0. The result follows.
Suppose z= y= 2, Then w= v = w and the result is trivial. ez =
then u = v and the linear condition holds automatically. However, the
result may fail. Let (u,u,w) = (12, 12, 10), (2,y,2) = (1,1,9), so that the
cubie condition is satisfied with a¥ = 1729. But uow + zyz = 1449. If we
put these numbers into the above solution, we find that (+) consists of
p+atr=12(p+ q)+10r=(p+9) +9r=
and that 6 = 4/49, ¢ = 1/49. Thus, u =
equation
2, w = 10 are the roots of the
0 = 63¢° — 235247 + 288121 — 115920 = 21(t — 10)(t ~ 12)(3t — 46)
and z= 1, 2=9 are the roots of
0= 21(3¢9 + 74? — 343¢ + 333) = 21(¢ — 1)(¢ — 9)(8¢ + 37).
‘Tins, if we take rather (u,v, w) = (12,46/3,10), (2, u, 2) = (1,-37/3,9).
‘then the hypotheses and the conclusion of the problem are satisfied.
35. ‘The given inequality has no solution when z < 1 since all summands on
the left side are negative and no solutions for large 2 when all summands
assume very small positive values. The inequality will be satisfied when 2Solutions to Problems; Chapter 8 383
slightly exceeds any one of the integers 1,2,...,70 and not satisfied when
+ is slightly less than one of the integers 2,3,...,70. Let
70
(2) = 8(2=1)--+(2—)-(2-70)—4 k(x = 1)--- (2) --- (2-70)
Then p(r) > 0 when r = 1,3,5,...,69 and p(r) < O when r = 2,4,6,...,70.
Since deg p(2) = 70 and p() > 0 for large 2, p(x) has exactly one real zero
1, in each of the open intervals (r,r + 1) (1