Search Results for ""

Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...

Given a random variable x and a probability density function P(x), if there exists an h>0 such that M(t)=<e^(tx)> (1) for |t|<h, where <y> denotes the expectation value of y, ...

The nth raw moment mu_n^' (i.e., moment about zero) of a distribution P(x) is defined by mu_n^'=<x^n>, (1) where <f(x)>={sumf(x)P(x) discrete distribution; intf(x)P(x)dx ...

The moment problem, also called "Hausdorff's moment problem" or the "little moment problem," may be stated as follows. Given a sequence of numbers {mu_n}_(n=0)^infty, under ...

A second-order partial differential equation of the form Hr+2Ks+Lt+M+N(rt-s^2)=0, (1) where H, K, L, M, and N are functions of x, y, z, p, and q, and r, s, t, p, and q are ...

The point of concurrence of the six planes in Monge's tetrahedron theorem.

Draw a circle that cuts three given circles perpendicularly. The solution is known as the radical circle of the given three circles. If it lies outside the three circles, ...

The six planes through the midpoints of the edges of a tetrahedron and perpendicular to the opposite edges concur in a point known as the Monge point.

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...