Search Results for ""
1011 - 1020 of 4217 for Strong Lawof Small NumbersSearch Results

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...
If r is a root of the polynomial equation x^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, where the a_is are integers and r satisfies no similar equation of degree <n, then r is called an ...
The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...
In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a floating-point representation is an unencoded member of a floating-point format which represents either ...
Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...
For every positive integer n, there exists a circle in the plane having exactly n lattice points on its circumference. The theorem is based on the number r(n) of integral ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
In 1657, Fermat posed the problem of finding solutions to sigma(x^3)=y^2, and solutions to sigma(x^2)=y^3, where sigma(n) is the divisor function (Dickson 2005). The first ...
A power floor prime sequence is a sequence of prime numbers {|_theta^n_|}_n, where |_x_| is the floor function and theta>1 is real number. It is unknown if, though extremely ...
Let the sum of squares function r_k(n) denote the number of representations of n by k squares, then the summatory function of r_2(k)/k has the asymptotic expansion ...

...