Search Results for ""

For a general quadrilateral with sides of length a, b, c, and d, the area K is given by (1) where s=1/2(a+b+c+d) (2) is the semiperimeter, A is the angle between a and d, and ...

Using a Tschirnhausen transformation, the principal quintic form can be transformed to the one-parameter form w^5-10cw^3+45c^2w-c^2=0 (1) named after Francesco Brioschi ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

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 ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

This theorem states that, for a partial differential equation involving a time derivative of order n, the solution is uniquely determined if time derivatives up to order n-1 ...

Let the probabilities of various classes in a distribution be p_1, p_2, ..., p_k, with observed frequencies m_1, m_2, ..., m_k. The quantity ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

Let r and s be positive integers which are relatively prime and let a and b be any two integers. Then there is an integer N such that N=a (mod r) (1) and N=b (mod s). (2) ...