- cint/*: Revamped the launch-scheme for ginaccint.bin. It must be done

[ginac.git] / ginac / numeric.cpp

diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp
index f1a073aa61ebf37af51a4170ac3d3cbcfec5cdd0..b322b1bd2870a38445a393479750a933f87d632f 100644 (file)
--- a/ginac/numeric.cpp
+++ b/ginac/numeric.cpp
@@ -1504,7 +1504,7 @@ const numeric bernoulli(const numeric & nn)
     // return Bern;
     // 
     // But if somebody works with the n'th Bernoulli number she is likely to
-    // also need all previous Bernoulli numbers we need a complete remember
+    // also need all previous Bernoulli numbers. So we need a complete remember
     // table and above divide and conquer algorithm is not suited to build one
     // up.  The code below is adapted from Pari's function bernvec().
     //