For over fifteen years, x86 CPUs have shipped with a dedicated hardware instruction for carryless multiplication. It’s a small but stubborn primitive that sits…
Evaluate a degree-n polynomial with about n/2 multiplications. Type a polynomial, pick ℚ, ℝ, ℂ, a Mersenne prime or a binary field, and get the preprocessed evaluation chain as math, C code or a circuit — everything runs in your browser.
The notorious Jacobian conjecture can be formulated concretely over the complex numbers as follows. Conjecture 1 (Jacobian Conjecture) Let $latex {F:{\bf C}^n \rightarrow {\bf C}^n}&fg=000000$ …
