Search Results for ""

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

There are a number of interesting results related to the tiling of squares. For example, M. Laczkovich has shown that there are exactly three shapes of non-right triangles ...

Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...

A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...

Given a system of two ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y), (2) let x_0 and y_0 denote fixed points with x^.=y^.=0, so f(x_0,y_0) = 0 (3) g(x_0,y_0) ...

Let G be a permutation group on a set Omega and x be an element of Omega. Then G_x={g in G:g(x)=x} (1) is called the stabilizer of x and consists of all the permutations of G ...

Stable distributions are a class of probability distributions allowing skewness and heavy tails (Rimmer and Nolan 2005). They are described by an index of stability (also ...

A local Banach algebra A is stably unital if the collection M_infty(A) of square infinite-dimensional matrices with entries in A has an approximate identity consisting of ...

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...