-
[جعبه ابزار](https://www.kifabzar.com/category/243/%D8%AC%D8%B9%D8%A8%D9%87-%D8%A7%D8%A8%D8%B2%D8%A7%D8%B1)
[جعبه ابزار پلاستیکی](https://www.kifabzar.com/category/281/%D8%AC%D8%B9%D8%A8%D9%87-%D8%A7…
-
```
The idea of adding rational numbers to mpmath has been brought up before.
Now, I'm a fan of the Unix philosophy "do one thing, and do it well".
Mpmath is intended to do floating-point arithmetic w…
-
# Summary
At the moment, the `try_inverse` function has a trait bound of Real. I can't think of any technical reasons (although there might exist some) not to just use Field.
This also might be ap…
-
This works
```
sage: R. = ZZ[]
sage: sqrt(1+x+O(x^5))
1 + 1/2*x - 1/8*x^2 + 1/16*x^3 - 5/128*x^4 + O(x^5)
```
One would expect this to work:
```
sage: R. = ZZ[[]]
sage: exp(x+O(x^5))
Traceback (…
-
The parent of the inverse of a Laurent polynomial can be three different things
```
sage: R. = LaurentPolynomialRing(ZZ)
sage: parent(~x)
Univariate Laurent Polynomial Ring in x over Integer Ring
s…
-
-
Float comparison is risky and is not a good practice, I think most programmers would agree this. So should we drop the support (or raise specialized error) when user calling this method, or we should …
-
The stdlib Data.Rational is fast. The follwing code compute instanrtly.
``` agda
{-# OPTIONS --safe --cubical --two-level #-}
module Scalar where
open import Data.Rational as ℚ hiding (_+_ ; _*_…
-
> Study notes mainly from Khan Academy. Not literally for Kindergarten maths only, but also including all K12 math subjects.
#### `KHAN ACADEMY MASTERY` rules collected:
- 1 `skill` means 1 pract…
-
I've been thinking for a while about how to "correctly" implement modular arithmetic, such that it is:
- Easy to prove properties about
- Easily extensible to other rings (e.g. polynomials over the …