Search Results for ""

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

Primorial primes are primes of the form p_n#+/-1, where p_n# is the primorial of p_n. A coordinated search for such primes is being conducted on PrimeGrid. p_n#-1 is prime ...

A rigorous mathematical argument which unequivocally demonstrates the truth of a given proposition. A mathematical statement that has been proven is called a theorem. ...

If A moves along a known curve, then P describes a pursuit curve if P is always directed toward A and A and P move with uniform velocities. Pursuit curves were considered in ...

The biconjugate gradient method often displays rather irregular convergence behavior. Moreover, the implicit LU decomposition of the reduced tridiagonal system may not exist, ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...

A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...