Search Results for ""

The grouping of data into bins (spaced apart by the so-called class interval) plotting the number of members in each bin versus the bin number. The above histogram shows the ...

A composite number defined analogously to a Smith number except that the sum of the number's digits equals the sum of the digits of its distinct prime factors (excluding 1). ...

Suppose that A is a Banach algebra and X is a Banach A-bimodule. For n=0, 1, 2, ..., let C^n(A,X) be the Banach space of all bounded n-linear mappings from A×...×A into X ...

A function phi(t) satisfies the Hölder condition on two points t_1 and t_2 on an arc L when |phi(t_2)-phi(t_1)|<=A|t_2-t_1|^mu, with A and mu positive real constants. In some ...

Let 1/p+1/q=1 (1) with p, q>1. Then Hölder's inequality for integrals states that int_a^b|f(x)g(x)|dx<=[int_a^b|f(x)|^pdx]^(1/p)[int_a^b|g(x)|^qdx]^(1/q), (2) with equality ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

Define F(1)=1 and S(1)=2 and write F(n)=F(n-1)+S(n-1), where the sequence {S(n)} consists of those integers not already contained in {F(n)}. For example, F(2)=F(1)+S(1)=3, so ...

The sequence defined by G(0)=0 and G(n)=n-G(G(n-1)). (1) The first few terms for n=1, 2, ... are 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, ... (OEIS A005206). This can be ...

The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...

Let b_1=1 and b_2=2 and for n>=3, let b_n be the least integer >b_(n-1) which can be expressed as the sum of two or more consecutive terms. The resulting sequence is 1, 2, 3, ...