#11802: Generation of Lucas sequences modulo an integer
-------------------------------------+-------------------------------------
Reporter: somindu | Owner: AlexGhitza
Type: enhancement | Status: positive_review
Priority: minor | Milestone: sage-6.1
Component: basic arithmetic | Resolution:
Keywords: Lucas sequence | Merged in:
ecc2011 | Reviewers: Travis Scrimshaw,
Authors: Somindu Chaya | Jean-Pierre Flori
Ramanna, Shashank Singh, Srinivas | Work issues:
Vivek Venkatesh, Travis Scrimshaw | Commit:
Report Upstream: N/A | 7c11ef2fa7e67e616fdfde414f69747334fe7c4a
Branch: | Stopgaps:
public/arith/lucas_seqences-11802 |
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by zimmerma):
> Maybe Paul would be interested and he surely knows what this is about.
sorry with the change to git I am unable to figure out what is the diff
with respect to Sage 6.0.
Thus I can only give general comments:
1) it makes no sense to have a {{{slow_lucas}}} and a {{{fast_lucas}}}
function. The philosophy in Sage is to use {{{algorithm='recurrence'}}} or
{{{algorithm='matrix_exponentiation'}}} instead (for example).
2) I don't see why the case Q<>1 could not be implemented either by the
recurrence or the matrix
exponentiation.
3) instead of separate functions for ZZ and IntegerModRing(n), it would be
nicer to have a single function with an option {{{ring=ZZ}}} (default) and
{{{ring=IntegerModRing(15)}}}.
Paul
--
Ticket URL: <http://trac.sagemath.org/ticket/11802#comment:16>
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/groups/opt_out.
