Search Results for ""

An algorithm for computing an Egyptian fraction (Stewart 1992).

The Cauchy product of two sequences f(n) and g(n) defined for nonnegative integers n is defined by (f degreesg)(n)=sum_(k=0)^nf(k)g(n-k).

A number puzzle in which a group of arithmetical operations has some or all of its digits replaced by letters or symbols, and where the original digits must be found. In such ...

A surface which is related to Cayley numbers.

Elementary methods consist of arithmetic, geometry, and high school algebra. These are the only tools that may be used in the branch of number theory known as elementary ...

Elementary number theory is the branch of number theory in which elementary methods (i.e., arithmetic, geometry, and high school algebra) are used to solve equations with ...

The identity PVint_(-infty)^inftyF(phi(x))dx=PVint_(-infty)^inftyF(x)dx (1) holds for any integrable function F(x) and phi(x) of the form ...

A multinomial series is generalization of the binomial series discovered by Johann Bernoulli and Leibniz. The multinomial series arises in a generalization of the binomial ...

The series which arises in the binomial theorem for negative integer -n, (x+a)^(-n) = sum_(k=0)^(infty)(-n; k)x^ka^(-n-k) (1) = sum_(k=0)^(infty)(-1)^k(n+k-1; k)x^ka^(-n-k) ...

A number theoretic function is a function whose domain is the set of positive integers.