Search Results for ""

The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...

Prellberg (2001) noted that the limit c=lim_(n->infty)(T_n)/(B_nexp{1/2[W(n)]^2})=2.2394331040... (OEIS A143307) exists, where T_n is a Takeuchi number, B_n is a Bell number, ...

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.

Taking the pole as the inversion center, the hyperbolic spiral inverts to Archimedes' spiral r=atheta.

Elliptic curve primality proving, abbreviated ECPP, is class of algorithms that provide certificates of primality using sophisticated results from the theory of elliptic ...

Faà di Bruno's formula gives an explicit equation for the nth derivative of the composition f(g(t)). If f(t) and g(t) are functions for which all necessary derivatives are ...

A normal distribution in a variate X with mean mu and variance sigma^2 is a statistic distribution with probability density function ...

An N-cluster is a point lattice configuration in which the distance between every pair of points is an integer, no three points are collinear, and no four points are ...

Curves with Cartesian equation ay^2=x(x^2-2bx+c) with a>0. The above equation represents the third class of Newton's classification of cubic curves, which Newton divided into ...

The Bôcher Memorial Prize is awarded by the American Mathematical Society every five years for notable research in analysis that has appeared in a recognized North American ...