Search Results for ""

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) ...

A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...

The ampersand curve is the name given by Cundy and Rowlett (1989, p. 72) to the quartic curve with implicit equation (y^2-x^2)(x-1)(2x-3)=4(x^2+y^2-2x)^2. (1) Although it is ...

A plane tiling is said to be isohedral if the symmetry group of the tiling acts transitively on the tiles, and n-isohedral if the tiles fall into n orbits under the action of ...

Because even high-resolution computer monitors have a relatively small number of pixels, when graphics or text display distinguish between individual pixels. The result is ...

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...

The continued fraction for Apéry's constant zeta(3) is [1; 4, 1, 18, 1, 1, 1, 4, 1, ...] (OEIS A013631). The positions at which the numbers 1, 2, ... occur in the continued ...

A number having 666 digits (where 666 is the beast number) is called an apocalypse number. The Fibonacci number F_(3184) is the smallest Fibonacci apocalypse number (Livio ...

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function, and define the aliquot sequence of n by ...