TOPICS
Search

Search Results for ""


391 - 400 of 1564 for Monotonic SequenceSearch Results
Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...
A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...
In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...
The Lucas-Lehmer test is an efficient deterministic primality test for determining if a Mersenne number M_n is prime. Since it is known that Mersenne numbers can only be ...
Minkowski's question mark function is the function y=?(x) defined by Minkowski for the purpose of mapping the quadratic surds in the open interval (0,1) into the rational ...
The negabinary representation of a number n is its representation in base -2 (i.e., base negative 2). It is therefore given by the coefficients a_na_(n-1)...a_1a_0 in n = ...
The Pell numbers are the numbers obtained by the U_ns in the Lucas sequence with P=2 and Q=-1. They correspond to the Pell polynomial P_n(x) and Fibonacci polynomial F_n(x) ...
If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...
Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...
Ruffini's rule a shortcut method for dividing a polynomial by a linear factor of the form x-a which can be used in place of the standard long division algorithm. This method ...
1 ... 37|38|39|40|41|42|43 ... 157 Previous Next

...