Search Results for ""
21 - 30 of 144 for e ApproximationsSearch Results
The second Brocard point is the interior point Omega^' (also denoted tau_2 or Z_2) of a triangle DeltaABC with points labeled in counterclockwise order for which the angles ...
Let E_n(f) be the error of the best uniform approximation to a real function f(x) on the interval [-1,1] by real polynomials of degree at most n. If alpha(x)=|x|, (1) then ...
Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...
An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...
A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...
Twin primes are pairs of primes of the form (p, p+2). The term "twin prime" was coined by Paul Stäckel (1862-1919; Tietze 1965, p. 19). The first few twin primes are n+/-1 ...
A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...
Dawson's integral (Abramowitz and Stegun 1972, pp. 295 and 319), also sometimes called Dawson's function, is the entire function given by the integral F(x) = ...
Given a real number x, find the powers of a base b that will shift the digits of x a number of places n to the left. This is equivalent to solving b^x=b^nx (1) or x=n+log_bx. ...
A limiting value of a holonomic function near a singular point. Holonomic constants include Apéry's constant, Catalan's constant, Pólya's random walk constants for d>2, and ...
...
View search results from all Wolfram sites (7836 matches)

