Search Results for ""

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...

Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

A circumconic is a conic section that passes through the vertices of a triangle (Kimberling 1998, p. 235). Every circumconic has a trilinear equation of the form ...

The American Mathematical Society awards two prizes named in honor of Prof. Frank Nelson Cole, a senior member of the AMS who made a bequest to the society in 1928 upon his ...

In December 1920, M. Schönfinkel presented in a report to the Mathematical Society in Göttingen a new type of formal logic based on the concept of a generalized function ...

A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...

The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...

The 9.1.2 equation A^9=B^9+C^9 (1) is a special case of Fermat's last theorem with n=9, and so has no solution. No 9.1.3, 9.1.4, 9.1.5, 9.1.6, 9.1.7, 9.1.8, or 9.1.9 ...

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