Search Results for ""

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

The Goffinet dragon is the fractal obtained by plotting all points spanned by powers of the complex number p=0.65-0.3i (Trott 2004, p. 9).

Let X be a metric space, A be a subset of X, and d a number >=0. The d-dimensional Hausdorff measure of A, H^d(A), is the infimum of positive numbers y such that for every ...

For real, nonnegative terms x_n and real p with 0<p<1, the expression lim_(k->infty)x_0+(x_1+(x_2+(...+(x_k)^p)^p)^p)^p converges iff (x_n)^(p^n) is bounded.

Let A be a matrix with the elementary divisors of its characteristic matrix expressed as powers of its irreducible polynomials in the field F[lambda], and consider an ...

The identities between the symmetric polynomials Pi_k(x_1,...,x_n) and the sums of kth powers of their variables S_k(x_1,...,x_n)=sum_(j=1)^nx_j^k. (1) The identities are ...

Polynomial identities involving sums and differences of like powers include x^2-y^2 = (x-y)(x+y) (1) x^3-y^3 = (x-y)(x^2+xy+y^2) (2) x^3+y^3 = (x+y)(x^2-xy+y^2) (3) x^4-y^4 = ...

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

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