TOPICS
Search

Search Results for ""


3271 - 3280 of 4217 for Strong Lawof Small NumbersSearch Results
A transformation which transforms from a two-dimensional continuous uniform distribution to a two-dimensional bivariate normal distribution (or complex normal distribution). ...
One of the polynomials obtained by taking powers of the Brahmagupta matrix. They satisfy the recurrence relation x_(n+1) = xx_n+tyy_n (1) y_(n+1) = xy_n+yx_n. (2) A list of ...
The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...
A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...
A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...
A real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...
Let A and B be any sets. Then the product of |A| and |B| is defined as the Cartesian product |A|*|B|=|A×B| (Ciesielski 1997, p. 68; Dauben 1990, p. 173; Moore 1982, p. 37; ...
A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...
A connected set is a set that cannot be partitioned into two nonempty subsets which are open in the relative topology induced on the set. Equivalently, it is a set which ...
A cyclotomic field Q(zeta) is obtained by adjoining a primitive root of unity zeta, say zeta^n=1, to the rational numbers Q. Since zeta is primitive, zeta^k is also an nth ...
1 ... 325|326|327|328|329|330|331 ... 422 Previous Next

...