Search Results for ""

The Peano-Gosper curve is a plane-filling function originally called a "flowsnake" by R. W. Gosper and M. Gardner. Mandelbrot (1977) subsequently coined the name Peano-Gosper ...

If f_1(x), ..., f_s(x) are irreducible polynomials with integer coefficients such that no integer n>1 divides f_1(x), ..., f_s(x) for all integers x, then there should exist ...

Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A fractal curve of infinite length which bounds an area twice that of the original square.

There are two similar but distinct concepts related to equidecomposability: "equidecomposable" and "equidecomposable by dissection." The difference is in that the pieces ...

The repeated application of a transformation.

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A Chen prime is a prime number p for which p+2 is either a prime or semiprime. Chen primes are named after Jing Run Chen who proved in 1966 that there are infinitely many ...