Search Results for ""

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...

The order of a finite field is the number of elements it contains.

The determination of the number of alternating permutations having elements {1,2,...,n}.

A shuffling algorithm used in a class of random number generators.

The symbol "-" which is used to denote a negative number or subtraction.

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...

The number of poles of an automorphic function in the closure of its fundamental region.