-
It would be good to always check integers for overflow and thereby providing users with an integer type that actually behaves like an integer or at least fails completely instead of giving "wrong" res…
-
In the history implementation of barrett_reduce function, the output is in {0,...,q} congruent to a modulo q.
But in Commits on Nov 20, 2020, the output of barrett_reduce is in {-(q-1)/2,...,(q-1)/2}…
-
# Description
Inside `assets/js/particle.js` lies the code for the typewriter effect on the landing page. The code, however, moves through the array of words found in the `data-words` attributes, and…
-
``` python
from cf_xarray.units import units
220 * units.degrees_east == (-140 * units.degrees_east)
```
is `False`. Can this be `True` instead?
-
To add the Number Theoretic Algorithm:
**This is a(n):**
- [ ] New algorithm
- [x] Update to an existing algorithm
- [ ] Error
- [ ] Proposal to the Repository
**Details:**
Number T…
-
The files `src/sage/rings/polynomial/polynomial_template.pxi` and `src/sage/libs/flint/nmod_poly_linkage.pxi` are a mess:
1. They are almost completely undocumented
2. The functions in it cannot be …
-
Algorithms to solve it,
1. Modular multiplicative inverse
2. Combinatorics and Permutation
-
Implement better multiplication for large numbers.
Multiplication currently uses Toom-3, which is O(n^1.47) for n BigDigits. This can be improved to O(n log n) using the Fast Fourier Transform (on …
-
[p1083](https://github.com/carbon-language/carbon-lang/blob/trunk/proposals/p1083.md) and the [current design](https://github.com/carbon-language/carbon-lang/blob/trunk/docs/design/README.md#integer-t…
-
All integers in Fortran are signed. It is a common request to include unsigned integers. At the very least to help with the interoperation with the C API that uses unsigned integers.
The best appro…