Search Results for ""

The Parry point is one of the two intersections of the Parry circle and the circumcircle of a triangle (the other is the focus of the Kiepert parabola, which is Kimberling ...

Let L, M, and N be lines through A, B, C, respectively, parallel to the Euler line. Let L^' be the reflection of L in sideline BC, let M^' be the reflection of M in sideline ...

The maximum distance between n points in three dimensions can occur no more than 2n-2 times. Also, there exists a fixed number c such that no distance determined by a set of ...

A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

Let sigma(m) be the divisor function of m. Then two numbers m and n are a quasiamicable pair if sigma(m)=sigma(n)=m+n+1. The first few are (48, 75), (140, 195), (1050, 1925), ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

A random closed set (RACS) in R^d is a measurable function from a probability space (Omega,A,P) into (F,Sigma) where F is the collection of all closed subsets of R^d and ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

A row-convex polyomino is a self-avoiding convex polyomino such that the intersection of any horizontal line with the polyomino has at most two connected components. A ...