Search Results for ""

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

The n functions f_1(x), f_2(x), ..., f_n(x) are linearly dependent if, for some c_1, c_2, ..., c_n in R not all zero, sum_(i=1)^nc_if_i(x)=0 (1) for all x in some interval I. ...

A number which is simultaneously octagonal and heptagonal. Let O_m denote the mth octagonal number and H_n the nth heptagonal number, then a number which is both octagonal ...

A number which is simultaneously octagonal and hexagonal. Let O_n denote the nth octagonal number and H_m the mth hexagonal number, then a number which is both octagonal and ...

A number which is simultaneously octagonal and triangular. Let O_n denote the nth octagonal number and T_m the mth triangular number, then a number which is both octagonal ...

A partially ordered set is defined as an ordered pair P=(X,<=). Here, X is called the ground set of P and <= is the partial order of P.

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

For x>0, J_0(x) = 2/piint_0^inftysin(xcosht)dt (1) Y_0(x) = -2/piint_0^inftycos(xcosht)dt, (2) where J_0(x) is a zeroth order Bessel function of the first kind and Y_0(x) is ...

There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...