Search Results for ""

Given two intersecting lines or line segments, the amount of rotation about the point of intersection (the vertex) required to bring one into correspondence with the other is ...

An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...

Betti numbers are topological objects which were proved to be invariants by Poincaré, and used by him to extend the polyhedral formula to higher dimensional spaces. ...

A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...

A cubic curve is an algebraic curve of curve order 3. An algebraic curve over a field K is an equation f(X,Y)=0, where f(X,Y) is a polynomial in X and Y with coefficients in ...

The 7.1.2 equation A^7+B^7=C^7 (1) is a special case of Fermat's last theorem with n=7, and so has no solution. No solutions to the 7.1.3, 7.1.4, 7.1.5, 7.1.6 equations are ...

The Fuhrmann triangle of a reference triangle DeltaABC is the triangle DeltaF_CF_BF_A formed by reflecting the mid-arc points arcM_A, arcM_B, arcM_C about the lines AB, AC, ...

A geodesic is a locally length-minimizing curve. Equivalently, it is a path that a particle which is not accelerating would follow. In the plane, the geodesics are straight ...

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...