TOPICS
Search

Search Results for ""


10381 - 10390 of 13135 for Computational GeometrySearch Results
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 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 ...
The square wave, also called a pulse train, or pulse wave, is a periodic waveform consisting of instantaneous transitions between two levels. The square wave is sometimes ...
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 ...
That part of a positive integer left after all square factors are divided out. For example, the squarefree part of 24=2^3·3 is 6, since 6·2^2=24. For n=1, 2, ..., the first ...
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) ...

...