Search Results for ""

A specific type of ultraproduct that can be used to construct nonstandard universes and obtain the transfer principle as a corollary of Łoś' theorem for ultraproducts.

A generalized dodecagon is a generalized polygon of order 12. GD(1,2) is the (3,12)-cage graph, more commonly known as the Tutte 12-cage. GD(2,1) is the line graph of the ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

The circumcircle is a triangle's circumscribed circle, i.e., the unique circle that passes through each of the triangle's three vertices. The center O of the circumcircle is ...

A cyclic pentagon is a not necessarily regular pentagon on whose polygon vertices a circle may be circumscribed. Let such a pentagon have edge lengths a_1, ..., a_5, and area ...

Let A_1, A_2, A_3, and A_4 be four points on a circle, and H_1, H_2, H_3, H_4 the orthocenters of triangles DeltaA_2A_3A_4, etc. If, from the eight points, four with ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

The length of the polygonal spiral is found by noting that the ratio of inradius to circumradius of a regular polygon of n sides is r/R=(cot(pi/n))/(csc(pi/n))=cos(pi/n). (1) ...

A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...