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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

264 SPECIAL NUMBERS<br />

Rearranging, we have an expression <strong>for</strong> the difference between H, and Inn:<br />

H,-Inn = 1- i(HF’ -1) _ f (j-$/%1) - $-$‘-1) - . . .<br />

When n -+ 00, the right-hand side approaches the limiting value<br />

1 -;&(2)-l) -3&(3).-l) - $(LV-1) -... ><br />

which is now known as Euler’s constant and conventionally denoted by the<br />

Greek letter y. In fact, L(r) - 1 is approximately l/2’, so this infinite series “Huius igitur quanconverges<br />

rather rapidly and we can compute the decimal value titatis constantis<br />

y = 0.5772156649. . . . (6.64)<br />

Euler’s argument establishes the limiting relation<br />

lim (H, -Inn) = y;<br />

n-CC<br />

(6.65)<br />

thus H, lies about 58% of the way between the two extremes in (6.60). We<br />

are gradually homing in on its value.<br />

Further refinements are possible, as we will see in Chapter 9. We will<br />

prove, <strong>for</strong> example, that<br />

1 En<br />

H, = lnn+y+&-- -<br />

1 2n2 + 120n4 ’<br />

O

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

Saved successfully!

Ooh no, something went wrong!