#11516: zeta in modular integer ring is primitive
-----------------------------+----------------------------------------------
Reporter: kedlaya | Owner: was
Type: defect | Status: new
Priority: minor | Milestone: sage-4.7.1
Component: number theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Kiran Kedlaya
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Karl-Dieter Crisman (at Sage Edu Days 3) points out that the documentation
of the zeta method for a modular integer ring is a bit misleading.
{{{
sage: R = IntegerModRing(11)
sage: R.zeta(5, all=True)
[9, 5, 4, 3]
}}}
All well and good, but the documentation says:
{{{
Return an n-th root of unity in self if there is one, or raise an
ArithmeticError otherwise.
INPUT:
* ``n`` -- positive integer
* ``all`` -- bool, default: False. If True, return a list of all
n-th roots of 1.
}}}
The point is that "n-th root of 1" should be "primitive n-th root of 1".
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11516>
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 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-trac?hl=en.