Search Results for ""

The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...

A fractal which can be written as a Lindenmayer system with initial string "YF", string rewriting rules "X" -> "YF+XF+Y", "Y" -> "XF-YF-X", and angle 60 degrees.

For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.

The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...

Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...

The Hajós graph (Brandstädt et al. 1987, Berge 1989) is another name for the Sierpiński sieve graph S_2, which is isomorphic to the 2-sun graph. However, the term is also ...

A Brier number is a number that is both a Riesel number and a Sierpiński number of the second kind, i.e., a number n such that for all k>=1, the numbers n·2^k+1 and n·2^k-1 ...

Let p be prime and r = r_mp^m+...+r_1p+r_0 (0<=r_i<p) (1) k = k_mp^m+...+k_1p+k_0 (0<=k_i<p), (2) then (r; k)=product_(i=0)^m(r_i; k_i) (mod p). (3) This is proved in Fine ...

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

A real number that is b-normal for every base 2, 3, 4, ... is said to be absolutely normal. As proved by Borel (1922, p. 198), almost all real numbers in [0,1) are absolutely ...