#15820: Implement sequences of bounded integers
-------------------------------------+-------------------------------------
Reporter: SimonKing | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.3
Component: algebra | Resolution:
Keywords: sequence bounded | Merged in:
integer | Reviewers:
Authors: Simon King | Work issues: Fix flakyness in
Report Upstream: N/A | adding sequences
Branch: | Commit:
u/SimonKing/ticket/15820 | 735939e593c9c302ff42c4973cbfe2e48eb22644
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by SimonKing):
Very odd. Could it be that I hit a bug in GMP in the conversion of an
integer to a string representation at base `2^n`? Namely, in my examples,
the 32-adic string representation used to pickle a bounded integer
sequence is not representing the stored bit array, but the 31-adic or
10-adic string representation works fine (but probably is slower).
This seems to happen when the last limb used to store a GMP integer is in
fact zero.
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:78>
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.
