Search Results for ""

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

The word "number" is a general term which refers to a member of a given (possibly ordered) set. The meaning of "number" is often clear from context (i.e., does it refer to a ...

A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...

The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...

Consider decomposition the factorial n! into multiplicative factors p_k^(b_k) arranged in nondecreasing order. For example, 4! = 3·2^3 (1) = 2·3·4 (2) = 2·2·2·3 (3) and 5! = ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

A Chaitin's constant, also called a Chaitin omega number, introduced by Chaitin (1975), is the halting probability of a universal prefix-free (self-delimiting) Turing ...