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.

54 SUMS<br />

This <strong>for</strong>mula indicates why harmonic numbers tend to pop up in the solutions<br />

to discrete problems like the analysis of quicksort, just as so-called natural<br />

logarithms arise naturally in the solutions to continuous problems.<br />

Now that we’ve found an analog <strong>for</strong> lnx, let’s see if there’s one <strong>for</strong> e’.<br />

What function f(x) has the property that Af(x) = f(x), corresponding to the<br />

identity De” = e”? Easy:<br />

f(x+l)-f(X) = f(x) w f(x+ 1) = 2f(x);<br />

so we’re dealing with a simple recurrence, and we can take f(x) = 2” as the<br />

discrete exponential function.<br />

The difference of cx is also quite simple, <strong>for</strong> arbitrary c, namely<br />

A(?) = cx+’ - cX = (c - 1)~“.<br />

Hence the anti-difference of cx is c’/(c - 1 ), if c # 1. This fact, together with<br />

the fundamental laws (2.47) and (2.48), gives us a tidy way to understand the<br />

general <strong>for</strong>mula <strong>for</strong> the sum of a geometric progression:<br />

t<br />

a

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

Saved successfully!

Ooh no, something went wrong!