Search Results for ""

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...

The Fermat quotient for a number a and a prime base p is defined as q_p(a)=(a^(p-1)-1)/p. (1) If pab, then q_p(ab) = q_p(a)+q_p(b) (2) q_p(p+/-1) = ∓1 (3) (mod p), where the ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The Engel polyhedra are two 38-faced plesiohedra (and hence space-filling) discovered by Engel (Engel 1981; Engel 1986, p. 220; Grünbaum and Shephard 1980; Senechal 1990, ...

An isoscelizer of an (interior) angle A in a triangle DeltaABC is a line through points I_(AB)I_(AC) where I_(AB) lies on AB and I_(AC) on AC such that DeltaAI_(AB)I_(AC) is ...

The number q in a fraction p/q.

The number 13.

A friend of a number n is another number m such that (m,n) is a friendly pair.

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...