TOPICS
Search

Search Results for ""


1121 - 1130 of 9247 for Random Walk 2 DimensionalSearch Results
Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...
Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...
Apéry's numbers are defined by A_n = sum_(k=0)^(n)(n; k)^2(n+k; k)^2 (1) = sum_(k=0)^(n)([(n+k)!]^2)/((k!)^4[(n-k)!]^2) (2) = _4F_3(-n,-n,n+1,n+1;1,1,1;1), (3) where (n; k) ...
The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...
The greatest common divisor, sometimes also called the highest common divisor (Hardy and Wright 1979, p. 20), of two positive integers a and b is the largest divisor common ...
The Ulam sequence {a_i}=(u,v) is defined by a_1=u, a_2=v, with the general term a_n for n>2 given by the least integer expressible uniquely as the sum of two distinct earlier ...
The term "Cartan algebra" has two meanings in mathematics, so care is needed in determining from context which meaning is intended. One meaning is a "Cartan subalgebra," ...
The circumsphere of given set of points, commonly the vertices of a solid, is a sphere that passes through all the points. A circumsphere does not always exist, but when it ...
Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...
The quartic curve given by the implicit equation (x^2-a^2)(x-a)^2+(y^2-a^2)^2=0, (1) so-named because of its resemblance to a tooth. The bicuspid curve has cusps at (a,-a) ...
1 ... 110|111|112|113|114|115|116 ... 925 Previous Next

...