Search Results for ""

Consider the sequence of partial sums defined by s_n=sum_(k=1)^n(-1)^kk^(1/k). (1) As can be seen in the plot above, the sequence has two limit points at -0.812140... and ...

Define q=e^(2piitau) (cf. the usual nome), where tau is in the upper half-plane. Then the modular discriminant is defined by ...

The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...

Every nonconstant entire function attains every complex value with at most one exception (Henrici 1988, p. 216; Apostol 1997). Furthermore, every analytic function assumes ...

Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

There are several attractive polyhedron compounds consisting of three cubes. The first (left figures) arises by joining three cubes such that each shares two C_2 axes (Holden ...

The Egyptian Mathematical Leather Roll (EMLR), dates to the Middle Kingdom, and was purchased in Egypt in 1858 by Henry Rhind, near the time when the Rhind papyrus was ...

A function is a relation that uniquely associates members of one set with members of another set. More formally, a function from A to B is an object f such that every a in A ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...