Hi, is there a function in sympy number theory to get the prime divisors of a given number, other than taking the divisors and checking for primality?
Thank you, Kasun -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sy...@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
