Search Results for ""

The triangle DeltaA^*B^*C^* obtained by reflecting the vertices of a reference triangle DeltaABC about the opposite sides is called the reflection triangle (Grinberg 2003). ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

Consider a game, first proposed by Nicolaus Bernoulli, in which a player bets on how many tosses of a coin will be needed before it first turns up heads. The player pays a ...

Sangaku problems, often written "san gaku," are geometric problems of the type found on devotional mathematical wooden tablets ("sangaku") which were hung under the roofs of ...

The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...

If two similar figures lie in the plane but do not have parallel sides (i.e., they are similar but not homothetic), there exists a center of similitude, also called a ...

Picking two independent sets of points x and y from a unit uniform distribution and placing them at coordinates (x,y) gives points uniformly distributed over the unit square. ...

Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...