commit | 9527afd02cd0cefeb08d024b09172616cfa9b804 | [log] [tgz] |
---|---|---|
author | Ezio Melotti <ezio.melotti@gmail.com> | Thu Jul 08 15:03:02 2010 +0000 |
committer | Ezio Melotti <ezio.melotti@gmail.com> | Thu Jul 08 15:03:02 2010 +0000 |
tree | cdd7ae8de4ee9c350edc31a0c57c2d4453a511ca | |
parent | 73ca440e3d71cdcb86c5277351b7fb53eb988439 [diff] |
Fix typo in a comment in mathmodule.c.
diff --git a/Modules/mathmodule.c b/Modules/mathmodule.c index b1d7a36..7f9372a 100644 --- a/Modules/mathmodule.c +++ b/Modules/mathmodule.c
@@ -1170,7 +1170,7 @@ * http://www.luschny.de/math/factorial/binarysplitfact.html * * Faster algorithms exist, but they're more complicated and depend on - * a fast prime factoriazation algorithm. + * a fast prime factorization algorithm. * * Notes on the algorithm * ----------------------