Updates:
Status: WontFix
Comment #4 on issue 4019 by smi...@gmail.com: divisors could use a 'pairs'
flag
http://code.google.com/p/sympy/issues/detail?id=4019
def divisor_pairs(n):
Return pairs of divisors of n, (a, b), such that a = b. A
generator of pairs (not necessarily in
Comment #5 on issue 4019 by asmeu...@gmail.com: divisors could use
a 'pairs' flag
http://code.google.com/p/sympy/issues/detail?id=4019
Another thing to be considered is if they can be done more efficiently than
the niave way.
--
You received this message because this project is
Comment #3 on issue 4019 by asmeu...@gmail.com: divisors could use
a 'pairs' flag
http://code.google.com/p/sympy/issues/detail?id=4019
I guess if it's useful enough. (d, n//d) doesn't seem that bad to me,
though. Unless you've got a billion divisors, but in that case, I don't
think this
Comment #2 on issue 4019 by smi...@gmail.com: divisors could use a 'pairs'
flag
http://code.google.com/p/sympy/issues/detail?id=4019
(modulo the conditional to take the middle element when the list has an odd
length)
Rather than another flag, should this just be called `divisor_pairs`?
Comment #1 on issue 4019 by asmeu...@gmail.com: divisors could use
a 'pairs' flag
http://code.google.com/p/sympy/issues/detail?id=4019
Or list(zip(d, reversed(d)))[:len(d)//2].
--
You received this message because this project is configured to send all
issue notifications to this address.
