Search Results for ""

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

The Robertson-Wegner graph is of the four (5,5)-cage graphs, also called Robertson's cage (Read and Wilson 1998, p. 273). Like the other (5,5)-cages, the Robertson-Wegner ...

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

The Wong graph is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

The geometry of the Lie group consisting of real matrices of the form [1 x y; 0 1 z; 0 0 1], i.e., the Heisenberg group.

A series of the form sum_(n=0)^inftya_nJ_(nu+n)(z), (1) where nu is a real and J_(nu+n)(z) is a Bessel function of the first kind. Special cases are ...

The invariants of a Weierstrass elliptic function P(z|omega_1,omega_2) are defined by the Eisenstein series g_2(omega_1,omega_2) = 60sum^'_(m,n)Omega_(mn)^(-4) (1) ...