Search Results for ""

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The theory of point sets and sequences having a uniform distribution. Uniform distribution theory is important in modeling and simulation, and especially in so-called Monte ...

To pick a random point on the surface of a unit sphere, it is incorrect to select spherical coordinates theta and phi from uniform distributions theta in [0,2pi) and phi in ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

An ordinary differential equation (frequently called an "ODE," "diff eq," or "diffy Q") is an equality involving a function and its derivatives. An ODE of order n is an ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...