TOPICS
Search

Search Results for ""


1511 - 1520 of 2284 for Napoleon PointsSearch Results
Let s_i be the orders of singular points on a curve (Coolidge 1959, p. 56). Harnack's first theorem states that a real irreducible curve of order n cannot have more than ...
z(1-z)(d^2y)/(dz^2)+[c-(a+b+1)z](dy)/(dz)-aby=0. It has regular singular points at 0, 1, and infty. Every second-order ordinary differential equation with at most three ...
In univariate interpolation, an interpolant is a function L=L(x) which agrees with a particular function f at a set of known points x_0,x_1,x_2,...,x_n and which is used to ...
The sphere with respect to which inverse points are computed (i.e., with respect to which geometrical inversion is performed). For example, the cyclides are inversions in a ...
A closed interval corresponding to a finite portion of an infinite line. Line segments are generally labeled with two letters corresponding to their endpoints, say A and B, ...
There are several different definition of link. In knot theory, a link is one or more disjointly embedded circles in three-space. More informally, a link is an assembly of ...
The points of tangency of the Lucas inner circle with the Lucas circles are the inverses of the vertices A, B, and C in the Lucas circles radical circle. These form the Lucas ...
Consider the Lagrange interpolating polynomial f(x)=b_0+(x-1)(b_1+(x-2)(b_3+(x-3)+...)) (1) through the points (n,p_n), where p_n is the nth prime. For the first few points, ...
The mid-arc triangle is the triangle DeltaA^'B^'C^' whose vertices consist of the intersections of the internal angle bisectors with the incircle, where the points of ...
A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...
1 ... 149|150|151|152|153|154|155 ... 229 Previous Next

...