Search Results for ""

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 average number of regions N(n) into which n lines divide a square is N^_(n)=1/(16)n(n-1)pi+n+1 (Santaló 1976; Finch 2003, p. 481). The maximum number of sequences is ...

In the above figure, the identical squares A, B, C appear different in width and height, because subdividing a space makes it appear larger. A different orientation can also ...

As shown by Schnirelman (1944), a square can be inscribed in any closed convex curve, although it is not known if this holds true for every Jordan curve (Steinhaus 1999, p. ...

The square knot, also called the reef knot, is a composite knot of six crossings consisting of a knot sum of a trefoil knot and its mirror image (Rolfsen 1976, p. 220). The ...

A matrix for which horizontal and vertical dimensions are the same (i.e., an n×n matrix). A matrix m may be tested to determine if it is square in Wolfram Language using ...

The square orthobicupola is a convex equilateral solid that is Johnson solid J_(28). The unit square orthobicupola has volume V=2+4/3sqrt(2) (1) and Dehn invariant D = ...

The largest square dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, ... (OEIS A008833).

A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...

The square root method is an algorithm which solves the matrix equation Au=g (1) for u, with A a p×p symmetric matrix and g a given vector. Convert A to a triangular matrix ...