Search Results for ""

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

An equation for a lattice sum b_3(1) (Borwein and Bailey 2003, p. 26) b_3(1) = sum^'_(i,j,k=-infty)^infty((-1)^(i+j+k))/(sqrt(i^2+j^2+k^2)) (1) = ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

The "Foxtrot series" is a mathematical sum that appeared in the June 2, 1996 comic strip FoxTrot by Bill Amend (Amend 1998, p. 19; Mitchell 2006/2007). It arose from a ...

An algorithm which extrapolates the partial sums s_n of a series sum_(n)a_n whose convergence is approximately geometric and accelerates its rate of convergence. The ...

Given a weighted, undirected graph G=(V,E) and a graphical partition of V into two sets A and B, the cut of G with respect to A and B is defined as cut(A,B)=sum_(i in A,j in ...

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