#17372: Make quadratic_residues more efficient
---------------------------------+------------------------
Reporter: kcrisman | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.5
Component: number theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+------------------------
Description changed by jdemeyer:
Old description:
> There HAS to be a better way than the current one.
> {{{
> n = abs(int(n))
> X = sorted(set([ZZ((a*a)%n) for a in range(n//2+1)]))
> return X
> }}}
> At the very least, we could put each of the `a` into `Integers(n)` first
> to (hopefully) make the multiplication a little quicker!
New description:
There HAS to be a better way than the current one.
{{{
n = abs(int(n))
X = sorted(set([ZZ((a*a)%n) for a in range(n//2+1)]))
return X
}}}
Perhaps using bitsets instead of `set()` and doing the multiplication in
`ZZ` instead of using Python `int`s.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/17372#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
