Fix many spelling errors

This commit is contained in:
Landon Curt Noll
2021-02-12 22:09:47 -08:00
parent 486f4c5626
commit 507fe026e5
154 changed files with 482 additions and 476 deletions

View File

@@ -20,7 +20,7 @@ DESCRIPTION
combinatorial problems, e.g. for n >= 1, catalan(n) is the number of
ways of using parentheses to express a product of n + 1 letters in
terms of binary products; it is the number of ways of dissecting a
convex polygon with n + 2 sides into triangles by nonintersecting
convex polygon with n + 2 sides into triangles by non-intersecting
diagonals; it is the number of integer-component-incrementing paths
from (x,y) = (0,0) to (x,y) = (n,n) for which always y <= x.