Search Results for ""

Propositional calculus is the formal basis of logic dealing with the notion and usage of words such as "NOT," "OR," "AND," and "implies." Many systems of propositional ...

Complex analysis is the study of complex numbers together with their derivatives, manipulation, and other properties. Complex analysis is an extremely powerful tool with an ...

There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...

Find the shape of the curve down which a bead sliding from rest and accelerated by gravity will slip (without friction) from one point to another in the least time. The term ...

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

In response to a letter from Goldbach, Euler considered sums of the form s_h(m,n) = sum_(k=1)^(infty)(1+1/2+...+1/k)^m(k+1)^(-n) (1) = ...

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

The finite difference is the discrete analog of the derivative. The finite forward difference of a function f_p is defined as Deltaf_p=f_(p+1)-f_p, (1) and the finite ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...