Sage int64

January 8th, 2009






Sage int64

[sage-devel] Re: is_zero: msg#01401
EXAMPLES: sage: mod(13,5^10).is_zero() @@ -1680,7 +1680,7 @@ cdef class IntegerMod_int64(IntegerMod_a sage: mod(5^12,5^10).is_zero() True ... (more...)

modular.math.washington.edu
type 'integer_mod_pyx.IntegerMod_int64'> sage: loads(a.dumps()) == a True """ IntegerMod_abstract.__init__(self, parent, value) (more...)

26.4 Elements of
... 0)) for R in Rs] [, , , more...)
Tags:   Elements

Sage Notebook | Welcome
... extern from "stdint.h": ctypedef int int_fast32_t ctypedef int int_fast64_t int_fast32_t INTEGER_MOD_INT32_LIMIT int_fast64_t INTEGER_MOD_INT64_LIMIT cimport sage ... (more...)

#4533 ([with patch; needs work] divisors function slow for integers ...
CPU times: user 0.02 s, sys: 0.00 s, total: 0.02 s Wall time: 0.02 s sage: v = numpy.array(m).astype(numpy.int64) sage: time v.sort() CPU times: user 0.00 s, sys: 0.00 s, total: 0 ... (more...)

Sage-ST
type CARD64 = 0 .. high (INT64); CARD32 = type cardinal; CARD16 = type word; CARD8 = type BYTE; Integer64 = type INT64; (more...)
Tags:   Sage

sage.rings.integer_mod.IntegerMod_int64
File: sage/rings/integer_mod.pyx (starting at line 2085) Elements of $\Z/n\Z$ for n small enough to be operated on in 64 bits AUTHORS: -- Robert Bradshaw (2006-09-14) (more...)

[sage-devel] Re: is_zero: msg#01402
... Returns \code{True} if this is not $0$, otherwise \code{False}. > > EXAMPLES: > sage: mod(13,5^10).is_zero() > @@ -1680,7 +1680,7 @@ cdef class IntegerMod_int64(IntegerMod_a > sage: mod(5 ... (more...)

Sage Notebook | Welcome
... for R in Rs] [, , , more...)

#4470: 2.8.14-non-quadratic-forms-U20.patch - Sage - Trac
1930 2011 1931 2012: sage: loads(a.dumps()) == a : 1932 2013: True (more...)


Close
E-mail It