Search Results for ""

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...

Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...

Ahmed's integral is the definite integral int_0^1(tan^(-1)(sqrt(x^2+2)))/(sqrt(x^2+2)(x^2+1))dx=5/(96)pi^2 (OEIS A096615; Ahmed 2002; Borwein et al. 2004, pp. 17-20). This is ...

A function representable as a generalized Fourier series. Let R be a metric space with metric rho(x,y). Following Bohr (1947), a continuous function x(t) for (-infty<t<infty) ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Enclose a sphere in a cylinder and cut out a spherical segment by slicing twice perpendicularly to the cylinder's axis. Then the lateral surface area of the spherical segment ...

The word argument is used in several differing contexts in mathematics. The most common usage refers to the argument of a function, but is also commonly used to refer to the ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...