Search Results for ""

The inequality (j+1)a_j+a_i>=(j+1)i, which is satisfied by all A-sequences.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

For a sequence {chi_i}, the Levine-O'Sullivan greedy algorithm is given by chi_1 = 1 (1) chi_i = max_(1<=j<=i-1)(j+1)(i-chi_j) (2) for i>1. The sequence generated by this ...

Poisson's theorem gives the estimate (n!)/(k!(n-k)!)p^kq^(n-k)∼e^(-np)((np)^k)/(k!) for the probability of an event occurring k times in n trials with n>>1, p<<1, and np ...

A statistical test making use of the statistical ranks of data points. Examples include the Kolmogorov-Smirnov test and Wilcoxon signed rank test.

Taylor's inequality is an estimate result for the value of the remainder term R_n(x) in any n-term finite Taylor series approximation. Indeed, if f is any function which ...

Bayesian analysis is a statistical procedure which endeavors to estimate parameters of an underlying distribution based on the observed distribution. Begin with a "prior ...

Kloosterman's sum is defined by S(u,v,n)=sum_(h)exp[(2pii(uh+vh^_))/n], (1) where h runs through a complete set of residues relatively prime to n and h^_ is defined by hh^_=1 ...

A goodness-of-fit test for any statistical distribution. The test relies on the fact that the value of the sample cumulative density function is asymptotically normally ...

The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...