#12179: Binomial of integer (mod n) returns integer
-------------------------------------+-------------------------------------
Reporter: scotts | Owner: AlexGhitza
Type: defect | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: basic arithmetic | Resolution:
Keywords: binomial | Merged in:
coefficient modulo sd35 | Reviewers: Colton Pauderis,
Authors: Sam Scott, Marco | Johan Bosman, Marco Streng
Streng | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Hi,
Ticket #17852 is in pass to be positively reviewed. Let me summarize what
will change when calling `rings.arith.binomial(x,y)`:
- `y` must be an integer (actually, I only asked that `ZZ(y)` does work
and the first lines of code do `y = ZZ(y)`)
- the output type is always the type of `x`
- if `factorial(y)` is not invertible a `ZeroDivisionError` is raised (I
checked the behavior on many finite rings that I was able to think of)
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/12179#comment:26>
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.
