diff options
| author | Ezio Melotti <ezio.melotti@gmail.com> | 2010-07-08 15:03:02 (GMT) |
|---|---|---|
| committer | Ezio Melotti <ezio.melotti@gmail.com> | 2010-07-08 15:03:02 (GMT) |
| commit | 9527afd02cd0cefeb08d024b09172616cfa9b804 (patch) | |
| tree | cdd7ae8de4ee9c350edc31a0c57c2d4453a511ca | |
| parent | 73ca440e3d71cdcb86c5277351b7fb53eb988439 (diff) | |
| download | cpython-9527afd02cd0cefeb08d024b09172616cfa9b804.zip cpython-9527afd02cd0cefeb08d024b09172616cfa9b804.tar.gz cpython-9527afd02cd0cefeb08d024b09172616cfa9b804.tar.bz2 | |
Fix typo in a comment in mathmodule.c.
| -rw-r--r-- | Modules/mathmodule.c | 2 |
1 files changed, 1 insertions, 1 deletions
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 @@ count_set_bits(unsigned long n) * 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 * ---------------------- |