-
* BirthdayProblem
- [x] BirthdayProblem.ipynb
- [x] ~ListsAndSets.ipynb
* GameOfLife
- [x] GameOfLife.ipynb
- [x] ~Convolution.ipynb
* JuliaSet
- [x] JuliaSet.ipynb
- [x] ~ColorI…
-
The method currently used to calculate polynomial greatest common divisor and lowest common multiple involves calculating the roots of the polynomials then using logic to determine the gcd and lcm. Th…
-
It's not true that a polynomial is a unit in its polynomial ring iff its constant coefficient is a unit. This has been assumed in the current implementation. For example, it isn't true over Z/nZ.
A…
-
This is old issue https://github.com/cbeleites/hyperSpec/issues/339
-
Imported from SourceForge on 2024-07-03 21:25:03
Created by **[macrakis](https://sourceforge.net/u/macrakis/)** on 2002-10-22 09:30:31
Original: https://sourceforge.net/p/maxima/bugs/171
---
expr:
…
rtoy updated
2 months ago
-
* [ ] Polynomials
* [ ] Factorization
* [ ] Square-free decomposition
* [x] Grobner bases
* [ ] Partial fraction decomposition
* [ ] Resultants
* [ ] Rootfinding
* [ ] Calculus
* [ ] Lim…
-
The intention of `any_root` was to provide a faster method of getting a root when you don't need them all. Unfortunately, the current implementation isn't faster than just factoring (at least in so…
-
Future research direction in extending IfElse conditionals past affine expressions
e.g. division, polynomials, piecewise affine, general black box functions
-
It is "finding small integer roots of a bivariate polynomial modulo an integer", however there is no way to specify this integer. Only polynomials over Z (not Z/mZ) are supported.
-
I am adding some results on rings:
- [x] Ring ideal definition
- [x] Product and sum of ideals
- [x] Prime ideal definition
- [x] Maximal ideal definition
- [x] Spectrum and Zariski topology
-…