Open roed314 opened 4 years ago
Branch: u/roed/smooth_parts
Author: David Roe
Branch pushed to git repo; I updated commit sha1. New commits:
2b951f5 | Improvement to remainders to prevent unnecessary multiplication |
Batch modifying tickets that will likely not be ready for 9.1, based on a review of the ticket title, branch/review status, and last modification date.
Some quick comments:
=
in examples like n.smooth_part(B = 10)
.I don't understand what this block is for:
+ if not isinstance(x, Integer):
+ x = Integer(x)
Setting new milestone based on a cursory review of ticket status, priority, and last modification date.
Setting a new milestone for this ticket based on a cursory review.
Changed branch from u/roed/smooth_parts to public/ticket/29730
Dan Bernstein has a paper from 2004 with an algorithm for computing the smooth parts of a bunch of integers. I recently implemented a simple version of it (without much effort toward optimization) which can still be useful when used on long lists.
Component: factorization
Author: David Roe
Branch/Commit: public/ticket/29730 @
9239d24
Issue created by migration from https://trac.sagemath.org/ticket/29370