Search Results for ""
3301 - 3310 of 4154 for Divide whole numbers and integersSearch Results
For a prime constellation, the Hardy-Littlewood constant for that constellation is the coefficient of the leading term of the (conjectured) asymptotic estimate of its ...
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
A riffle shuffle, in which the top half of the deck is placed in the left hand, and cards are then alternatively interleaved from the left and right hands. Using an ...
An interprime is the average of consecutive (but not necessarily twin) odd primes. The first few terms are 4, 6, 9, 12, 15, 18, 21, 26, 30, 34, ... (OEIS A024675). The first ...
If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...
Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...
Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...
A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...
Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...
A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...
...
View search results from all Wolfram sites (72000 matches)

