Search Results for ""
1171 - 1180 of 13135 for binary numberSearch Results
A set S is said to be GCD-closed if GCD(x_i,x_j) in S for 1<=i,j<=n.
If a_1, a_2, a_3, ... is an artistic sequence, then 1/a_1, 1/a_2, 1/a_3, ... is a melodic sequence. The recurrence relation obeyed by melodic series is ...
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 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 ...
...