F. Xavier Malcata

Mathematics for Enzyme Reaction Kinetics and Reactor Performance


Скачать книгу

rel="nofollow" href="#ulink_534d2138-ace4-5f23-8c76-cd6ca840ba47">Eq. (2.84).

      2.1.2 Geometric Series

      A geometric series is said to exist when each term is obtained from the previous one via multiplication by a constant parameter, k, viz.

      where the first term of the summation was made apparent; multiplication of both sides by k unfolds

      (2.89)equation

      where straightforward algebraic rearrangement leads to

      (2.91)equation

      (2.94)equation

      that mimics Eq. (2.87), as expected. Revisiting Eq. (2.72) with division of both sides by u0, one may insert Eq. (2.93) to get

      (2.96)equation

      at the expense of Eqs. (2.72), (2.73), and (2.95), which is equivalent to

      should k lie between 1 and 1, as it would give rise to a convergent series (i.e. kn + 1 → 0 when n → ∞, in this case). All remaining values, i.e. k ≤ −1 or k ≥ 1, produce divergent series – as apparent in Fig. 2.5; when k is nil, Eq. (2.93) turns to just

      (2.99)equation

Graph of Sn/u0 vs. n displaying 2 ascending curves labeled k = 2 and 1 and an almost flat curve labeled 0.5.

      An alternative proof of Eq. (2.93) comes from finite induction; one should first confirm that it applies to n = 0, i.e.

      (2.100)