Search Results for ""

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

The Euclidean metric is the function d:R^n×R^n->R that assigns to any two vectors in Euclidean n-space x=(x_1,...,x_n) and y=(y_1,...,y_n) the number ...

The minimal residue of a (mod m) is the value b or b-m, whichever is smaller in absolute value, where a=b (mod m). If m=2b (so that b=|b-m|), then the minimal residue is ...

For positive integer n, the K-function is defined by K(n) = 1^12^23^3...(n-1)^(n-1) (1) = H(n-1), (2) where the numbers H(n)=K(n+1) are called hyperfactorials by Sloane and ...

A set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...

A plane curve discovered by Maclaurin but first studied in detail by Cayley. The name Cayley's sextic is due to R. C. Archibald, who attempted to classify curves in a paper ...

The exponential factorial is defined by the recurrence relation a_n=n^(a_(n-1)), (1) where a_0=1. The first few terms are therefore a_1 = 1 (2) a_2 = 2^1=2 (3) a_3 = ...

The Hh-function is a function closely related to the normal distribution function. It can be defined using the auxilary functions Z(x) = 1/(sqrt(2pi))e^(-x^2/2) (1) Q(x) = ...

The Lemoine cubic is the triangle cubic with trilinear equation It passes through Kimberling centers X_n for n=3, 4, 32, 56, and 1147.

The outer Napoleon circle, a term coined here for the first time, is the circumcircle of the outer Napoleon triangle. It has center at the triangle centroid G (and is thus ...