Search Results for ""

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

A univariate distribution proportional to the F-distribution. If the vector d is Gaussian multivariate-distributed with zero mean and unit covariance matrix N_p(0,I) and M is ...

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

The Penrose triangle, also called the tribar (Cerf), tri-bar (Ernst 1987), impossible tribar (Pappas 1989, p. 13), or impossible triangle, is an impossible figure published ...

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...