Search Results for ""

The concept of "random close packing" was shown by Torquato et al. (2000) to be mathematically ill-defined idea that is better replaced by the notion of "maximally random ...

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

There are a few plane curves known as "bean curves." The bean curve identified by Cundy and Rowllet (1989, p. 72) is the quartic curve given by the implicit equation ...

There are two distinct entities both known as the Lagrange number. The more common one arises in rational approximation theory (Conway and Guy 1996), while the other refers ...

The Mordell conjecture states that Diophantine equations that give rise to surfaces with two or more holes have only finite many solutions in Gaussian integers with no common ...

A plot of a function expressed in polar coordinates, with radius r as a function of angle theta. Polar plots can be drawn in the Wolfram Language using PolarPlot[r, {t, tmin, ...

"The" trifolium is the three-lobed folium with b=a, i.e., the 3-petalled rose curve. It is also known as the paquerette de mélibée (Apéry 1987, p. 85), with paquerette being ...

If one root of the equation f(x)=0, which is irreducible over a field K, is also a root of the equation F(x)=0 in K, then all the roots of the irreducible equation f(x)=0 are ...