Search Results for ""

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

In geometry, the term "enlargement" is a synonym for expansion. In nonstandard analysis, let X be a set of urelements, and let V(X) be the superstructure with individuals in ...

If a complex function is analytic at all finite points of the complex plane C, then it is said to be entire, sometimes also called "integral" (Knopp 1996, p. 112). Any ...

The so-called explicit formula psi(x)=x-sum_(rho)(x^rho)/rho-ln(2pi)-1/2ln(1-x^(-2)) gives an explicit relation between prime numbers and Riemann zeta function zeros for x>1 ...

Although the rigidity theorem states that if the faces of a convex polyhedron are made of metal plates and the polyhedron edges are replaced by hinges, the polyhedron would ...

The circumcircle of the Fuhrmann triangle. It has the line HNa, where H is the orthocenter and Na is the Nagel point, as its diameter. In fact, these points (Kimberling ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...

A number n for which the harmonic mean of the divisors of n, i.e., nd(n)/sigma(n), is an integer, where d(n)=sigma_0(n) is the number of positive integer divisors of n and ...