Search Results for ""
1151 - 1160 of 9247 for Random Walk 2 DimensionalSearch Results
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3-1/2v^2. (3) The coefficients of the coefficients of the first fundamental form are E ...
A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...
The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...
A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...
An asymmetric matrix is a square matrix that is not symmetric, i.e., a matrix A such that A^(T)!=A, where A^(T) denotes the transpose. An asymmetric matrix therefore ...
There are a number of attractive polyhedron compounds consisting of 12 octahedra. This compound will be implemented in a future version of the Wolfram Language as ...
An outcome is a subset of a probability space. Experimental outcomes are not uniquely determined from the description of an experiment, and must be agreed upon to avoid ...
The devil's curve was studied by G. Cramer in 1750 and Lacroix in 1810 (MacTutor Archive). It appeared in Nouvelles Annales in 1858. The Cartesian equation is ...
Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...
...
View search results from all Wolfram sites (477000 matches)

