Search Results for ""

The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...

A numeral is a symbol used to represent a number. Arabic numerals (0-9) are the ones most commonly used today. Other types, mainly of historical interest, include Egyptian, ...

Consider solutions to the equation x^y=y^x. (1) Real solutions are given by x=y for x,y>0, together with the solution of (lny)/y=(lnx)/x, (2) which is given by ...

A Redheffer matrix is a square (0,1)-matrix with elements a_(ij) equal to 1 if j=1 or i|j (i divides j), and 0 otherwise. For n=1, 2, ..., the first few Redheffer matrices ...

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...

A fractal which can be written as a Lindenmayer system with initial string "YF", string rewriting rules "X" -> "YF+XF+Y", "Y" -> "XF-YF-X", and angle 60 degrees.

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_4=f(x_4). Then Simpson's 3/8 rule ...

Gardner showed how to dissect a square into eight and nine acute scalene triangles. W. Gosper discovered a dissection of a unit square into 10 acute isosceles triangles, ...

The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G ...

A shortened term for integral transform. Geometrically, if S and T are two transformations, then the similarity transformation TST^(-1) is sometimes called the transform ...