Search Results for ""

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

The triangular orthobicupola is Johnson solid J_(27), consisting of eight equilateral triangles and six squares. If a triangular orthobicupola is oriented with triangles on ...

An integer n which is tested to see if it divides a given number.

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

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

A factor is a portion of a quantity, usually an integer or polynomial that, when multiplied by other factors, gives the entire quantity. The determination of factors is ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...