Search Results for ""

Let three equal circles with centers J_A, J_B, and J_C intersect in a single point H and intersect pairwise in the points A, B, and C. Then the circumcircle O of the ...

Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...

An ordered factorization is a factorization (not necessarily into prime factors) in which a×b is considered distinct from b×a. The following table lists the ordered ...

Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(nlgn) steps. Quicksort is a recursive ...

An unordered factorization is a factorization of a number into a product of factors where order is ignored. The following table lists the unordered factorizations of the ...

The Wallis formula follows from the infinite product representation of the sine sinx=xproduct_(n=1)^infty(1-(x^2)/(pi^2n^2)). (1) Taking x=pi/2 gives ...

A bounded lattice is an algebraic structure L=(L, ^ , v ,0,1), such that (L, ^ , v ) is a lattice, and the constants 0,1 in L satisfy the following: 1. for all x in L, x ^ ...

Let (A,<=) and (B,<=) be totally ordered sets. Let C=A×B be the Cartesian product and define order as follows. For any a_1,a_2 in A and b_1,b_2 in B, 1. If a_1<a_2, then ...

Let (A,<=) and (B,<=) be well ordered sets with ordinal numbers alpha and beta. Then alpha<beta iff A is order isomorphic to an initial segment of B (Dauben 1990, p. 199). ...

A subset E of a topological space S is said to be of first category in S if E can be written as the countable union of subsets which are nowhere dense in S, i.e., if E is ...