09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

260 SPECIAL NUMBERS<br />

’ ’ ’<br />

(The center of gravity of k objects, having respective weights WI, . . . , wk<br />

and having reSpeCtiVe Centers Of gravity at pOSitiOnS ~1, . . . pk, is at position<br />

(WPl +. . + WkPk)/bl + . + wk).) We can rewrite this recurrence in two<br />

equivalent <strong>for</strong>ms<br />

k&+1 = k + dl + . . . + dkp1 + dk , k 3 0;<br />

(k-l)dk = k-l +dl +...+dk-1, k> 1.<br />

Subtracting these equations tells us that<br />

kdk+l -(k-l)dk = 1 +dk, k> 1;<br />

hence dk+l = dk + l/k. The second card will be offset half a unit past the<br />

third, which is a third of a unit past the fourth, and so on. The general<br />

<strong>for</strong>mula<br />

&+I = Hk (6.56)<br />

follows by induction, and if we set k = n we get dn+l = H, as the total<br />

overhang when n cards are stacked as described.<br />

Could we achieve greater overhang by holding back, not pushing each<br />

card to an extreme position but storing up “potential gravitational energy”<br />

<strong>for</strong> a later advance? No; any well-balanced card placement has<br />

&+I 6 (l+dl)+(l-td~)+...+(l+dk)<br />

k<br />

,<br />

1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!