Search Results for ""

Given a sum and a set of weights, find the weights which were used to generate the sum. The values of the weights are then encrypted in the sum. This system relies on the ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

The group theoretical term for what is known to physicists, by way of its connection with matrix traces, as the trace. The powerful group orthogonality theorem gives a number ...

A fraction containing each of the digits 1 through 9 is called a pandigital fraction. The following table gives the number of pandigital fractions which represent simple unit ...

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

The line R[s]=1/2 in the complex plane on which the Riemann hypothesis asserts that all nontrivial (complex) Riemann zeta function zeros lie. The plot above shows the first ...

Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...

A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...

Let K_1 be a knot inside a torus, and knot the torus in the shape of a second knot (called the companion knot) K_2, with certain additional mild restrictions to avoid trivial ...