diff options
author | tege <tege@gmplib.org> | 2000-05-08 12:18:43 +0200 |
---|---|---|
committer | tege <tege@gmplib.org> | 2000-05-08 12:18:43 +0200 |
commit | b34b6071cca8557a2ecd9fb6ce3e32026afcf35d (patch) | |
tree | 3e58b0ac11d30744cc41e7923f8ca19d9b7bb98f /mpz/bin_ui.c | |
parent | 472078997fd800bbf952fc0a8b9d397d0db06857 (diff) | |
download | gmp-b34b6071cca8557a2ecd9fb6ce3e32026afcf35d.tar.gz |
Translate comment to English.
Diffstat (limited to 'mpz/bin_ui.c')
-rw-r--r-- | mpz/bin_ui.c | 14 |
1 files changed, 5 insertions, 9 deletions
diff --git a/mpz/bin_ui.c b/mpz/bin_ui.c index db8d71589..494550ae8 100644 --- a/mpz/bin_ui.c +++ b/mpz/bin_ui.c @@ -24,15 +24,11 @@ MA 02111-1307, USA. */ #include "longlong.h" /* -tege> Vilken är definitionen för negativa n? -teke> Den rekursiva definitionen funkar där också dvs -teke> -teke> k < 0 => bin(n,k) = 0 -teke> -teke> k == 0 => bin(n,k) = 1 -teke> -teke> 1 => bin(n,k) = bin(n-1,k-1)*n/k -(teke=Torsten Ekedahl) +We could make this work for negative n. The recursive defintion, + k < 0 => bin(n,k) = 0 + k == 0 => bin(n,k) = 1 + 1 => bin(n,k) = bin(n-1,k-1)*n/k +defined that situation too. */ /* This is a poor implementation. Look at bin_uiui.c for improvement ideas. */ |