Search Results for ""

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

If r is a root of the polynomial equation x^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, where the a_is are integers and r satisfies no similar equation of degree <n, then r is called an ...

If a discrete group of displacements in the plane has more than one center of rotation, then the only rotations that can occur are by 2, 3, 4, and 6. This can be shown as ...

The Darboux integral, also called a Darboux-Stieltjes integral, is a variant of the Stieltjes integral that is defined as a common value for the lower and upper Darboux ...

There are several types of integrals which go under the name of a "Dirichlet integral." The integral D[u]=int_Omega|del u|^2dV (1) appears in Dirichlet's principle. The ...

The point F at which the incircle and nine-point circle are tangent. It has triangle center function alpha=1-cos(B-C) (1) and is Kimberling center X_(11). If F is the ...

The so-called generalized Fourier integral is a pair of integrals--a "lower Fourier integral" and an "upper Fourier integral"--which allow certain complex-valued functions f ...

If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...