Merge pull request #73 from jessicayung/patch-1

fix: correct typo in section 7.1

Author: rougier

07-beyond-numpy.rst

@@ -39,7 +39,7 @@ surprising results. But let's start with the most obvious Python solution:
        return Z
 
 This solution is the slowest solution because it requires 4 loops, and more
-importantly, it tests all the different combinations (11641) of 4 integers
+importantly, it tests all the different combinations (14641) of 4 integers
 between 0 and 10 to retain only combinations whose sum is 10. We can of course
 get rid of the 4 loops using itertools, but the code remains slow: