Search Results for ""

A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

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, ...

The regular pentagon is the regular polygon with five sides, as illustrated above. A number of distance relationships between vertices of the regular pentagon can be derived ...

For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...

The Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...

A formula for the number of Young tableaux associated with a given Ferrers diagram. In each box, write the sum of one plus the number of boxes horizontally to the right and ...