/math/455/ - Source

[ home ] [ math / cs / ai / phy / as / chem / bio / geo ] [ civ / aero / mech / ee / hdl / os / dev / web / app / sys / net / sec ] [ med / fin / psy / soc / his / lit / lin / phi / arch ] [ off / vg / jp / 2hu / tc / ts / adv / hr / meta / tex ] [ chat ] [ wiki ]

Viewing source code

The following is the source code for post >>>/math/455

>>182
This is unironically an extremely good question. What is the general method for a computer to compute ANALYTICALLY  the solution to any kind of equation, aka the zeroes of a function in a field taking any number of inputs.
>Newton-Raphson for R^n
>Fermat little-Theorem for prime-characteristic fields
These are exemples of explicit solution methods for definite classes of equations. I am talking about an oracle than solves even in non-closed form expression.

$\mathcal{H}\textit{ome}$
$\mathcal{R}\textit{ules}$
$\mathcal{D}\textit{onate}$
$\mathcal{B}\textit{anned}$
$\mathcal{F.A.Q.}$
$\#\mathcal{C}\textit{hat}$
$\mathcal{W}\textit{iki}$