Search Results for ""

Schubert's application of the conservation of number principle.

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

For every k>1, there exist only finite many pairs of powers (p,p^') with p and p^' natural numbers and k=p^'-p.

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

The expected number of real zeros E_n of a random polynomial of degree n if the coefficients are independent and distributed normally is given by E_n = ...

The number of nodes in a graph is called its order.

The operation of taking an nth root of a number.