From 9527afd02cd0cefeb08d024b09172616cfa9b804 Mon Sep 17 00:00:00 2001
From: Ezio Melotti <ezio.melotti@gmail.com>
Date: Thu, 8 Jul 2010 15:03:02 +0000
Subject: [PATCH] Fix typo in a comment in mathmodule.c.

---
 Modules/mathmodule.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Modules/mathmodule.c b/Modules/mathmodule.c
index b1d7a36ee4c..7f9372af86b 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
  * ----------------------