Search Results for ""

Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...

Let A be a sum of squares of n independent normal standardized variates X_i, and suppose A=B+C where B is a quadratic form in the x_i, distributed as chi-squared with h ...

A diagram expressing how the gluing operation that connects the handlebodies involved in a Heegaard splitting proceeds, usually by showing how the meridians of the handlebody ...

The radius used in performing an inversion with respect to an inversion circle.

The order n>=2 L-polyomino consists of a vertical line of n squares with a single additional square attached at the bottom.

A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.

Let X be a topological vector space and for an arbitrary point x in X, denote by N_(x) the collection of all neighborhoods of x in X. A local base at x is any set B subset ...

A particular way of doing something, sometimes also called an algorithm or procedure. (According to Petkovšek et al. (1996), "a method is a trick that has worked at least ...

Let R be a number ring of degree n with 2s imaginary embeddings. Then every ideal class of R contains an ideal J such that ||J||<=(n!)/(n^n)(4/pi)^ssqrt(|disc(R)|), where ...

A nowhere-neat dissection in which squares of the same size are not allowed to share any part of a side.