Search Results for ""

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...

Chvátal defines the term hole to mean "a chordless cycle of length at least four." The restriction "of length at least four" allows use of the term "hole" regardless of if ...

The Hénon-Heiles equation is a nonlinear nonintegrable Hamiltonian system with x^.. = -(partialV)/(partialx) (1) y^.. = -(partialV)/(partialy), (2) where the potential energy ...

A hyperboloid is a quadratic surface which may be one- or two-sheeted. The one-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the ...

A the (first, or internal) Kenmotu point, also called the congruent squares point, is the triangle center constructed by inscribing three equal squares such that each square ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

The paradox of a man who states "I am lying." If he is lying, then he is telling the truth, and vice versa. Another version of this paradox is the Epimenides paradox. Such ...