Search Results for ""
1321 - 1330 of 1759 for Simple Random WalkSearch Results
The cyclic group C_8 is one of the three Abelian groups of the five groups total of group order 8. Examples include the integers modulo 8 under addition (Z_8) and the residue ...
The cyclic group C_9 is one of the two Abelian groups of group order 9 (the other order-9 Abelian group being C_3×C_3; there are no non-Abelian groups of order 9). An example ...
A limiting case in which a class of object changes its nature so as to belong to another, usually simpler, class. For example, the point is a degenerate case of the circle as ...
In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...
A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...
An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...
Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...
Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...
A double integral is a two-fold multiple integral. Examples of definite double integrals evaluating to simple constants include int_0^1int_0^1(dxdy)/(1-x^2y^2) = 1/8pi^2 (1) ...
A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...
...
View search results from all Wolfram sites (40119 matches)

