Search Results for ""

A graph G with m edges is said to be elegant if the vertices of G can be labeled with distinct integers (0,1,2,...,m) in such a way that the set of values on the edges ...

The group of an elliptic curve which has been transformed to the form y^2=x^3+ax+b is the set of K-rational points, including the single point at infinity. The group law ...

The elliptic exponential function eexp_(a,b)(u) gives the value of x in the elliptic logarithm eln_(a,b)(x)=1/2int_infty^x(dt)/(sqrt(t^3+at^2+bt)) for a and b real such that ...

The elliptic logarithm is generalization of integrals of the form int_infty^x(dt)/(sqrt(t^2+at)), for a real, which can be expressed in terms of logarithmic and inverse ...

The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

Two statements in logic are said to be equipollent if they are deducible from each other. Two sets A and B are said to be equipollent iff there is a one-to-one correspondence ...

The Erdős-Borwein constant E, sometimes also denoted alpha, is the sum of the reciprocals of the Mersenne numbers, E = sum_(n=1)^(infty)1/(2^n-1) (1) = ...

Erdős and Heilbronn (Erdős and Graham 1980) posed the problem of estimating from below the number of sums a+b where a in A and b in B range over given sets A,B subset= Z/pZ ...

There are infinitely many primes m which divide some value of the partition function P.