Search Results for ""

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...

The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...

In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

A planar straight line embedding of a planar graph is a planar embedding in which only straight line segments are used to connect the graph vertices. Fáry (1948) showed that ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

A prime magic square is a magic square consisting only of prime numbers (although the number 1 is sometimes allowed in such squares). The left square is the 3×3 prime magic ...

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