Hi Artur, On 27 Nov., 22:08, Artur <[email protected]> wrote: > John, > Many Thanks for support! Now I have all information which I need on the > start.
Good! I think tab completion and the possibility to see documentation and even the source code of the stuff is a big plus. > About Integer factorizations Will be worthy to implemented to SAGE probe > factorization with prime base to safe computer time. At least according to the benchmarks at http://sagemath.org/tour-benchmarks.html (factorization of 2^512-1), Sage is not bad at factoring integers. So, I guess using the existing implementation of factorization algorithms is a good starting point. Of course, if you observe that in some applications factorization is too slow and you know how to improve it, then you are welcome to demonstrate how. Cheers, Simon -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
