Search Results for ""

Borwein et al. (2004, pp. 4 and 44) term the expression of the integrals I_1 = int_0^1x^xdx (1) = 0.783430510... (2) I_2 = int_0^1(dx)/(x^x) (3) = 1.291285997... (4) (OEIS ...

A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...

Suppose W is the set of all complex-valued functions f on the interval [0,2pi] of the form f(t)=sum_(k=-infty)^inftyalpha_ke^(ikt) (1) for t in [0,2pi], where the alpha_k in ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

The q-analog of the Pochhammer symbol defined by (a;q)_k={product_(j=0)^(k-1)(1-aq^j) if k>0; 1 if k=0; product_(j=1)^(|k|)(1-aq^(-j))^(-1) if k<0; ...

Three or more points P_1, P_2, P_3, ..., are said to be collinear if they lie on a single straight line L. A line on which points lie, especially if it is related to a ...

A complex number z may be represented as z=x+iy=|z|e^(itheta), (1) where |z| is a positive real number called the complex modulus of z, and theta (sometimes also denoted phi) ...

Euler (1772ab) conjectured that there are no positive integer solutions to the quartic Diophantine equation A^4=B^4+C^4+D^4. This conjecture was disproved by Elkies (1988), ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...