Search Results for ""

Marion's theorem (Mathematics Teacher 1993, Maushard 1994, Morgan 1994) states that the area of the central hexagonal region determined by trisection of each side of a ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...

The Hurwitz zeta function zeta(s,a) is a generalization of the Riemann zeta function zeta(s) that is also known as the generalized zeta function. It is classically defined by ...

An order-n Costas array is a permutation on {1,...,n} such that the distances in each row of the triangular difference table are distinct. For example, the permutation ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

The quaternions are members of a noncommutative division algebra first invented by William Rowan Hamilton. The idea for quaternions occurred to him while he was walking along ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

Define the Euler measure of a polyhedral set as the Euler integral of its indicator function. It is easy to show by induction that the Euler measure of a closed bounded ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...