Search Results for ""

The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...

A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...

A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...

A pair of quantities (a, b) where ordering is significant, so (a, b) is considered distinct from (b, a) for a!=b.

An ambiguous term which is sometimes used to mean a partially ordered set and sometimes to mean a totally ordered set.

A rooted tree in which the order of the subtrees is significant. There is a one-to-one correspondence between ordered forests with n nodes and binary trees with n nodes.

The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...

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). ...

An ordinary differential equation of order n is an equation of the form F(x,y,y^',...,y^((n)))=0.

The y- (vertical) coordinate of a point in a two dimensional coordinate system. Physicists and astronomers sometimes use the term to refer to the axis itself instead of the ...