TOPICS
Search

Search Results for ""


941 - 950 of 1152 for Greatest Common DivisorSearch Results
The circle passing through the isodynamic points S and S^' and the triangle centroid G of a triangle DeltaA_1A_2A_3 (Kimberling 1998, pp. 227-228). The Parry circle has ...
A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...
Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...
The probability density function (PDF) P(x) of a continuous distribution is defined as the derivative of the (cumulative) distribution function D(x), D^'(x) = ...
The quasirhombicuboctahedron is the name given by Wenninger (1989, p. 132) to the uniform polyhedron with Maeder index 17 (Maeder 1997), Wenninger index 85 (Wenninger 1989), ...
The sample variance m_2 (commonly written s^2 or sometimes s_N^2) is the second sample central moment and is defined by m_2=1/Nsum_(i=1)^N(x_i-m)^2, (1) where m=x^_ the ...
A simple continued fraction is a special case of a generalized continued fraction for which the partial numerators are equal to unity, i.e., a_n=1 for all n=1, 2, .... A ...
The diagonal slash "/" used as the bar between numerator and denominator of an in-line fraction (Bringhurst 1997, p. 284). The solidus is also called a diagonal. Special care ...
Let two spheres of radii R and r be located along the x-axis centered at (0,0,0) and (d,0,0), respectively. Not surprisingly, the analysis is very similar to the case of the ...
Sphere line picking is the selection of pairs of points corresponding to vertices of a line segment with endpoints on the surface of a sphere. n random line segments can be ...
1 ... 92|93|94|95|96|97|98 ... 116 Previous Next

...