TOPICS
Search

Search Results for ""


481 - 490 of 831 for Computer programmingSearch Results
A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...
The Delaunay triangulation is a triangulation which is equivalent to the nerve of the cells in a Voronoi diagram, i.e., that triangulation of the convex hull of the points in ...
A Julia set with constant c chosen at the boundary of the Mandelbrot set (Branner 1989; Dufner et al. 1998, p. 225). The image above was computed using c=i.
The disdyakis triacontahedron is the dual polyhedron of the Archimedean great rhombicosidodecahedron A_2. It is also known as the hexakis icosahedron (Holden 1971, p. 55). It ...
Division by zero is the operation of taking the quotient of any number x and 0, i.e., x/0. The uniqueness of division breaks down when dividing by zero, since the product ...
Based on a problem in particle physics, Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) is the multinomial ...
The angle obtained by drawing the auxiliary circle of an ellipse with center O and focus F, and drawing a line perpendicular to the semimajor axis and intersecting it at A. ...
G_(ab)=R_(ab)-1/2Rg_(ab), where R_(ab) is the Ricci curvature tensor, R is the scalar curvature, and g_(ab) is the metric tensor. (Wald 1984, pp. 40-41). It satisfies ...
A deeper result than the Hardy-Ramanujan theorem. Let N(x,a,b) be the number of integers in [n,x] such that inequality a<=(omega(n)-lnlnn)/(sqrt(lnlnn))<=b (1) holds, where ...
An Euler-Jacobi pseudoprime to a base a is an odd composite number n such that (a,n)=1 and the Jacobi symbol (a/n) satisfies (a/n)=a^((n-1)/2) (mod n) (Guy 1994; but note ...
1 ... 46|47|48|49|50|51|52 ... 84 Previous Next

...