Updates:
Status: Fixed
Comment #6 on issue 3882 by smi...@gmail.com: divisors() is not
type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
Whether all output from ntheory should be Integer can be opened as a
separate issue if anyone feels that this the right thing
Updates:
Labels: EasyToFix
Comment #5 on issue 3882 by smi...@gmail.com: divisors() is not
type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
Comment #2 on issue 3882 by smi...@gmail.com: divisors() is not
type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
The simplest thing to do would be to have it work in ints like factorint
n = int(abs(n))
Working with Integer instead of int can significantly slow down some
Comment #3 on issue 3882 by asmeu...@gmail.com: divisors() is not
type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
Internally it can use ints if they are faster. Only the return value needs
to be changed.
--
You received this message because this project is configured
Comment #4 on issue 3882 by smi...@gmail.com: divisors() is not
type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
this might be the way to go, then:
n = int(abs(n))
if isprime(n):
rv = [1, n]
elif n == 1:
rv = [1]
elif n == 0:
rv =
Status: New
Owner:
Labels: Type-Defect Priority-Medium
New issue 3882 by trel...@psu.edu: divisors() is not type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
Ran into a bug today with divisors()
The issue is that divisors() is not consistent in the type of the factors
Comment #1 on issue 3882 by asmeu...@gmail.com: divisors() is not
type-consistent
http://code.google.com/p/sympy/issues/detail?id=3882
Issue 1973 would have made the set thing work.
I would just make the output always be Integer. It is a SymPy function
after all.
--
You received this
