Happy new year!

[ginac.git] / ginac / numeric.cpp

diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp
index fc6c692c3f966643c98dda5ad9c42ce7b95f9789..d38458d7dedefddd23731f17d123ea6e7e79fe96 100644 (file)
--- a/ginac/numeric.cpp
+++ b/ginac/numeric.cpp
@@ -7,7 +7,7 @@
  *  of special functions or implement the interface to the bignum package. */
 
 /*
- *  GiNaC Copyright (C) 1999-2004 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2005 Johannes Gutenberg University Mainz, Germany
  *
  *  This program is free software; you can redistribute it and/or modify
  *  it under the terms of the GNU General Public License as published by
@@ -1628,8 +1628,8 @@ const numeric binomial(const numeric &n, const numeric &k)
                }
        }
        
-       // should really be gamma(n+1)/gamma(r+1)/gamma(n-r+1) or a suitable limit
-       throw std::range_error("numeric::binomial(): don´t know how to evaluate that.");
+       // should really be gamma(n+1)/gamma(k+1)/gamma(n-k+1) or a suitable limit
+       throw std::range_error("numeric::binomial(): don't know how to evaluate that.");
 }
 
 
@@ -1810,7 +1810,7 @@ const numeric mod(const numeric &a, const numeric &b)
 /** Modulus (in symmetric representation).
  *  Equivalent to Maple's mods.
  *
- *  @return a mod b in the range [-iquo(abs(m)-1,2), iquo(abs(m),2)]. */
+ *  @return a mod b in the range [-iquo(abs(b)-1,2), iquo(abs(b),2)]. */
 const numeric smod(const numeric &a, const numeric &b)
 {
        if (a.is_integer() && b.is_integer()) {