Search Results for ""

A transformation formula for continued fractions (Lorentzen and Waadeland 1992) which can, for example, be used to prove identities such as ...

The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...

An identity in calculus of variations discovered in 1868 by Beltrami. The Euler-Lagrange differential equation is (partialf)/(partialy)-d/(dx)((partialf)/(partialy_x))=0. (1) ...

(dy)/(dx)+p(x)y=q(x)y^n. (1) Let v=y^(1-n) for n!=1. Then (dv)/(dx)=(1-n)y^(-n)(dy)/(dx). (2) Rewriting (1) gives y^(-n)(dy)/(dx) = q(x)-p(x)y^(1-n) (3) = q(x)-vp(x). (4) ...

The covariant derivative of the Riemann tensor is given by (1) Permuting nu, kappa, and eta (Weinberg 1972, pp. 146-147) gives the Bianchi identities ...

Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...

A hypothetic building design problem in optimization with constraints proposed by Bhatti (2000, pp. 3-5). To save energy costs for heating and cooling, an architect wishes to ...

The symbol intersection , used for the intersection of sets, and sometimes also for the logical connective AND instead of the symbol ^ (wedge). In fact, for any two sets A ...