Search Results for ""

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...

For every positive integer n, there is a unique finite sequence of distinct nonconsecutive (not necessarily positive) integers k_1, ..., k_m such that ...

An improper use of the symbol sqrt(-1) for the imaginary unit leads to the apparent proof of a false statement. sqrt(-1) = sqrt(-1) (1) sqrt((-1)/1) = sqrt(1/(-1)) (2) ...

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

A polyhedral graph is completely regular if the dual graph is also regular. There are only five types. Let rho be the number of graph edges at each node, rho^* the number of ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...