TOPICS
Search

Search Results for ""


301 - 310 of 352 for IntervalSearch Results
For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...
There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...
Let lim stand for the limit lim_(x->c), lim_(x->c^-), lim_(x->c^+), lim_(x->infty), or lim_(x->-infty), and suppose that lim f(x) and lim g(x) are both zero or are both ...
The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...
Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...
There are two sets of constants that are commonly known as Lebesgue constants. The first is related to approximation of function via Fourier series, which the other arises in ...
Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...
A Lorentz transformation is a four-dimensional transformation x^('mu)=Lambda^mu_nux^nu, (1) satisfied by all four-vectors x^nu, where Lambda^mu_nu is a so-called Lorentz ...
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 ...
A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...
1 ... 28|29|30|31|32|33|34 ... 36 Previous Next

...