Search Results for ""

A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...

Pronic numbers are figurate numbers of the form P_n=2T_n=n(n+1), where T_n is the nth triangular number. The first few are 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, ... (OEIS ...

Propositional calculus is the formal basis of logic dealing with the notion and usage of words such as "NOT," "OR," "AND," and "implies." Many systems of propositional ...

Find two distinct sets of integers {a_1,...,a_n} and {b_1,...,b_n}, such that for k=1, ..., m, sum_(i=1)^na_i^k=sum_(i=1)^nb_i^k. (1) The Prouhet-Tarry-Escott problem is ...

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

An algebraic integer of the form a+bsqrt(D) where D is squarefree forms a quadratic field and is denoted Q(sqrt(D)). If D>0, the field is called a real quadratic field, and ...