Search Results for ""
3341 - 3350 of 4217 for Strong Lawof Small NumbersSearch Results
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 ...
Following Yates (1980), a prime p such that 1/p is a repeating decimal with decimal period shared with no other prime is called a unique prime. For example, 3, 11, 37, and ...
A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...
A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...
A variate is a generalization of the concept of a random variable that is defined without reference to a particular type of probabilistic experiment. It is defined as the set ...
Wallis's constant is the real solution (x^3-2x-5)_1=2.0945514815... (OEIS A007493) to the cubic equation x^3-2x-5=0. It was solved by Wallis to illustrate Newton's method for ...
An expression is called "well-defined" (or "unambiguous") if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to not be ...
e^(i(ntheta))=(e^(itheta))^n. (1) From the Euler formula it follows that cos(ntheta)+isin(ntheta)=(costheta+isintheta)^n. (2) A similar identity holds for the hyperbolic ...
The A graph is the graph on 6 vertices illustrated above. Unfortunately, at least one author (Farrugia 1999, p. 2) uses the term "A-graph" to refer to the 5-node bull graph. ...
The banner graph is the (4,1)-tadpole graph illustrated above. It could perhaps also be termed the 'P graph.' It is implemented in the Wolfram Language as ...
...
View search results from all Wolfram sites (41045 matches)

