Search Results for ""

The coloring red of two complete subgraphs of n/2 points (for even n) in order to generate a blue-empty graph.

A method for constructing magic squares of odd order, also called de la Loubere's method.

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

The order n T-polyomino consists of a vertical line of n-3 squares capped by a horizontal line of three squares centered on the line.

Young's lattice Y_p is the partial order of partitions contained within a partition p ordered by containment (Stanton and White 1986; Skiena 1990, p. 77).

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

If P(x,y) and P(x^',y^') are two points on an ellipse (x^2)/(a^2)+(y^2)/(b^2)=1, (1) with eccentric angles phi and phi^' such that tanphitanphi^'=b/a (2) and A=P(a,0) and ...

A modulo multiplication group is a finite group M_m of residue classes prime to m under multiplication mod m. M_m is Abelian of group order phi(m), where phi(m) is the ...

Archimedes' cattle problem, also called the bovinum problema, or Archimedes' reverse, is stated as follows: "The sun god had a herd of cattle consisting of bulls and cows, ...

The Fermat axis is the central line connecting the first and second Fermat points. It has line function l=a(b^2-c^2)(a^2-b^2-bc-c^2)(a^2-b^2+bc-c^2), corresponding to ...