Search Results for ""
1661 - 1670 of 9247 for Random Walk 2 DimensionalSearch Results
If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...
A check which can be used to verify correct computations in a table of grouped classes. For example, consider the following table with specified class limits and frequencies ...
Call a number of the form n^2-k a "near-square number." Numbers of the form n^2-5 for n=1, 2, ... are -4, -1, 4, 11, 20, 31, 44, 59, 76, 95, ... (OEIS A028875). These are ...
An atlas is a collection of consistent coordinate charts on a manifold, where "consistent" most commonly means that the transition functions of the charts are smooth. As the ...
A surface (or "space") of section, also called a Poincaré section (Rasband 1990, pp. 7 and 93-94), is a way of presenting a trajectory in n-dimensional phase space in an ...
A vector space V is a set that is closed under finite vector addition and scalar multiplication. The basic example is n-dimensional Euclidean space R^n, where every element ...
The circum-medial triangle DeltaA^'B^'C^' is the circumcevian triangle of a reference triangle DeltaABC with respect to the triangle centroid G of DeltaABC (Kimberling 1998, ...
A Redheffer matrix is a square (0,1)-matrix with elements a_(ij) equal to 1 if j=1 or i|j (i divides j), and 0 otherwise. For n=1, 2, ..., the first few Redheffer matrices ...
A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...
Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...
...
View search results from all Wolfram sites (477000 matches)

