Search Results for ""

A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...

An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...

In a graph G, contraction of an edge e with endpoints u,v is the replacement of u and v with a single vertex such that edges incident to the new vertex are the edges other ...

An encoding is a way of representing a number or expression in terms of another (usually simpler) one. However, multiple expressions can also be encoded as a single ...

The term endomorphism derives from the Greek adverb endon ("inside") and morphosis ("to form" or "to shape"). In algebra, an endomorphism of a group, module, ring, vector ...

The term energy has an important physical meaning in physics and is an extremely useful concept. There are several forms energy defined in mathematics. In measure theory, let ...

The Diophantine equation sum_(j=1)^(m-1)j^n=m^n. Erdős conjectured that there is no solution to this equation other than the trivial solution 1^1+2^1=3^1, although this ...

A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...

A generalization of Fermat's little theorem. Euler published a proof of the following more general theorem in 1736. Let phi(n) denote the totient function. Then a^(phi(n))=1 ...

A Lie algebra over an algebraically closed field is called exceptional if it is constructed from one of the root systems E_6, E_7, E_8, F_4, and G_2 by the Chevalley ...