Search Results for ""

dtau^2=-eta_(alphabeta)dxi^alphadxi^beta, or (d^2xi^alpha)/(dtau^2)=0.

The partial differential equation u_t+uu_x=nuu_(xx) (Benton and Platzman 1972; Zwillinger 1995, p. 417; Zwillinger 1997, p. 130). The so-called nonplanar Burgers equation is ...

The second-order ordinary differential equation y^('')+g(y)y^('2)+f(x)y^'=0 (1) is called Liouville's equation (Goldstein and Braun 1973; Zwillinger 1997, p. 124), as are the ...

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...

A centered triangular number is a centered polygonal number consisting of a central dot with three dots around it, and then additional dots in the gaps between adjacent dots. ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

The partial differential equation u_(xt)=sinhu, which contains u_(xt) instead of u_(xx)-u_(tt) and sinhu instead to sinu, as in the sine-Gordon equation (Grauel 1985; ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...