Search Results for ""

A Schauder basis for a Banach space X is a sequence {x_n} in X with the property that every x in X has a unique representation of the form x=sum_(n=1)^(infty)alpha_nx_n for ...

The Zeckendorf representation of a positive integer n is a representation of n as a sum of nonconsecutive distinct Fibonacci numbers, n=sum_(k=2)^Lepsilon_kF_k, where ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...

Let S_N(s)=sum_(n=1)^infty[(n^(1/N))]^(-s), (1) where [x] denotes nearest integer function, i.e., the integer closest to x. For s>3, S_2(s) = 2zeta(s-1) (2) S_3(s) = ...

A set n distinct numbers taken from the interval [1,n^2] form a magic series if their sum is the nth magic constant M_n=1/2n(n^2+1) (Kraitchik 1942, p. 143). If the sum of ...

Given a Taylor series f(z)=sum_(n=0)^inftyC_nz^n=sum_(n=0)^inftyC_nr^ne^(intheta), (1) where the complex number z has been written in the polar form z=re^(itheta), examine ...

The arithmetic-geometric index of a graph is defined as half the sum of the matrix elements of its arithmetic-geometric matrix.

An integer-relation algorithm which is based on a partial sum of squares approach, from which the algorithm takes its name.

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.