-
While congruences can be quickly brute-forced for small n, some of the transformations of even quadratic equations with small coefficients generate congruences with n in the hundred-thousands. In thes…
-
Not the following three theorems have exactly the same hypotheses.
```
test1
b c d = triangle b c d; a = circumcenter a b c d; e = on_line e b d, on_tline e c c a; f = on_line f e c, on_tline f b b…
-
We should add a table recording when pairs of elliptic curves are N-congruent, and then display the results on elliptic curve homepages (and possibly add search functionality).
-
The `\pod, \mod, \bmod` and `\pmod` commands are not supported.
- `\pod` is a command to indicate a congruence relationship displaying the modulus in parentheses, separated from the left sibling by a …
arnog updated
4 years ago
-
From /roadmap: Compute Eisenstein ideal (torsion).
-
In `c/pthread/fib_safe-5.i` from #1356, we produce an unsound invariant. Opening the HTML view to see globals reveals that they somehow have all integer domains enabled:
> base:priv:unprotected:cur →…
-
In `ml_interactive`, the predicate `isCong` will find all strong congruences of a logic. The way it does that is by listing all partitions of the designated and undesignated truth values and checking…
rzach updated
3 years ago
-
Elementary discrete mathematics for computer science and engineering. Emphasis on mathematical definitions and proofs as well as on applicable methods. Topics include formal logic notation, proof meth…
-
Tilman, I have written a new solver that does the gaussian elimination in parallel. Furthermore, I believe it is possible to create a solver that operates asynchronously and distributed over a wide ne…
-
M = ∑ i=1 n Ti ⊗ fi
Modular Formula which denotes the "M", It has Tensor properties that represent multi-dimensional data and transformations flexibly and comprehensively. Multilinear maps allow inter…