Search Results for ""

If a real algebraic curve has no singularities except nodes and cusps, bitangents, and inflection points, then n+2tau_2^'+iota^'=m+2delta_2^'+kappa^', where n is the order, ...

The number of digits used to perform a given computation. The concepts of accuracy and precision are both closely related and often confused. While the accuracy of a number x ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

In 1891, Chebyshev and Sylvester showed that for sufficiently large x, there exists at least one prime number p satisfying x<p<(1+alpha)x, where alpha=0.092.... Since the ...

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

The number of outward directed graph edges from a given graph vertex in a directed graph.

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

Let y_n be a complex number for 1<=n<=N and let y_n=0 if n<1 or n>N. Then (Montgomery 2001).