Search Results for ""

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

For F_n the nth Fibonacci number, F_(n-1)F_(n+1)-F_n^2=(-1)^n. This identity was also discovered by Simson (Coxeter and Greitzer 1967, p. 41; Coxeter 1969, pp. 165-168; Wells ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...

The exponent of the largest power of 2 which divides a given number 2n. The values of the ruler function for n=1, 2, ..., are 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, ... (OEIS A001511).

Let the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...

A cubefree word contains no cubed words as subwords. The number of binary cubefree words of length n=1, 2, ... are 2, 4, 6, 10, 16, 24, 36, 56, 80, 118, ... (OEIS A028445). ...

A prime which does not divide the class number h(p) of the cyclotomic field obtained by adjoining a primitive pth root of unity to the field of rationals. A prime p is ...

A class of knots containing the class of alternating knots. Let c(K) be the link crossing number. Then for knot sum K_1#K_2 which is an adequate knot, ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...