Search Results for ""

The first few numbers whose abundance absolute values are odd squares (excluding the trivial cases of powers of 2) are 98, 2116, 4232, 49928, 80656, 140450, 550564, 729632, ...

A Lucas chain for an integer n>=1 is an increasing sequence 1=a_0<a_1<a_2<...<a_r=n of integers such that every a_k, k>=1, can be written as a sum a_k=a_i+a_j of smaller ...

If a function analytic at the origin has no singularities other than poles for finite x, and if we can choose a sequence of contours C_m about z=0 tending to infinity such ...

Müntz's theorem is a generalization of the Weierstrass approximation theorem, which states that any continuous function on a closed and bounded interval can be uniformly ...

A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...

A multimagic square such that the first, second, third, fourth, and fifth powers of the elements all yield magic squares is known as a pentamagic square. The first known ...

Campbell (2022) used the WZ method to obtain the sum (pi^2)/4=sum_(n=1)^infty(16^n(n+1)(3n+1))/(n(2n+1)^2(2n; n)^3), (1) where (n; k) is a binomial coefficient. There is a ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

Consider the sequence {x_n}_(n=0)^infty defined by x_0=1 and x_(n+1)=[3/2x_n], where [z] is the ceiling function. For n=0, 1, ..., the first few terms are 1, 2, 3, 5, 8, 12, ...

Scientific notation is the expression of a number n in the form a×10^p, where p=|_log_(10)|n|_| (1) is the floor of the base-10 logarithm of n (the "order of magnitude"), and ...