Implemented the most efficient algorithms for computing factorial and binomial (using...
commit7e7427adbbc62c655b2fd17243c5fb83c1ad485c
authormattpap <devnull@localhost>
Sat, 18 Aug 2007 03:02:05 +0000 (18 03:02 +0000)
committermattpap <devnull@localhost>
Sat, 18 Aug 2007 03:02:05 +0000 (18 03:02 +0000)
tree82f750a7149d30b65c2b2d3b6fd42fd5584a5b8c
parentca54fc89b0651616b536e03e02aaa26ad64cf7b0
Implemented the most efficient algorithms for computing factorial and binomial (using prime factorisation of special class of numbers). Generally refactored both functions and also gamma functions. In few hours I will implement proper combinatorial simplification and then all redundant imports will be removed.
12 files changed:
sympy/concrete/gosper.py
sympy/concrete/tests/test_sums_products.py
sympy/core/__init__.py
sympy/core/basic_methods.py
sympy/core/integer_sequences.py
sympy/integrals/integrals.py
sympy/specfun/__init__.py
sympy/specfun/factorials.py
sympy/specfun/gamma_functions.py [new file with mode: 0644]
sympy/specfun/tests/test_factorials.py
sympy/specfun/tests/test_gamma_functions.py [new file with mode: 0644]
sympy/specfun/zeta_functions.py