Search Results for ""

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A second-order ordinary differential equation of the form

A two-dimensional map which is conjugate to the Hénon map in its nondissipative limit. It is given by x^' = x+y^' (1) y^' = y+epsilony+kx(x-1)+muxy. (2)

Relates invariants of a curve defined over the integers. If this inequality were proven true, then Fermat's last theorem would follow for sufficiently large exponents. ...

If a function phi:(0,infty)->(0,infty) satisfies 1. ln[phi(x)] is convex, 2. phi(x+1)=xphi(x) for all x>0, and 3. phi(1)=1, then phi(x) is the gamma function Gamma(x). ...

The Bolyai expansion of a real number x is a nested root of the form x=a_0-1+RadicalBox[{{a, _, 1}, +, RadicalBox[{{a, _, 2}, +, RadicalBox[{{a, _, 3}, +, ...}, m]}, m]}, m], ...

For homogeneous polynomials P and Q of degree m and n, then sqrt((m!n!)/((m+n)!))[P]_2[Q]_2<=[P·Q]_2<=[P]_2[Q]_2, where [P·Q]_2 is the Bombieri norm.

Define E(x;q,a)=psi(x;q,a)-x/(phi(q)), (1) where psi(x;q,a)=sum_(n<=x; n=a (mod q))Lambda(n) (2) (Davenport 1980, p. 121), Lambda(n) is the Mangoldt function, and phi(q) is ...

A ring with a unit element in which every element is idempotent.

The domain of Booleans, sometimes denoted B, consisting of the elements True and False, implemented in the Wolfram Language as Booleans. In the Wolfram Language, a quantity ...