Search Results for ""

The integer sequence defined by the recurrence relation P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=P(1)=P(2)=1. This is the same recurrence relation as for the ...

Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

The pentagonal icositetrahedron is the 24-faced dual polyhedron of the snub cube A_7 and Wenninger dual W_(17). The mineral cuprite (Cu_2O) forms in pentagonal ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...

A quartic vertex-transitive graph is a quartic graph that is vertex transitive. Read and Wilson (1988, pp. 164-166) enumerate all connected quartic vertex-transitive graphs ...

The term "quotient" is most commonly used to refer to the ratio q=r/s of two quantities r and s, where s!=0. Less commonly, the term quotient is also used to mean the integer ...

If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...