Search Results for ""

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

Three guests decide to stay the night at a lodge whose rate they are initially told is $30 per night. However, after the guests have each paid $10 and gone to their room, the ...

In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...

The mode of a set of observations is the most commonly occurring value. For example, for a data set (3, 7, 3, 9, 9, 3, 5, 1, 8, 5) (left histogram), the unique mode is 3. ...

The second-order ordinary differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)-(x^2+n^2)y=0. (1) The solutions are the modified Bessel functions of the first and second kinds, ...

A surface which a monkey can straddle with both legs and his tail. A simple Cartesian equation for such a surface is z=x(x^2-3y^2), (1) which can also be given by the ...

A monotone triangle (also called a strict Gelfand pattern or a gog triangle) of order n is a number triangle with n numbers along each side and the base containing entries ...

A number which is simultaneously a nonagonal number N_m and heptagonal number Hep_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(5n-4). (1) Completing the ...

A number which is simultaneously a nonagonal number N_m and octagonal number O_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n(3n-2). (1) Completing the ...

Let u_(p) be a unit tangent vector of a regular surface M subset R^3. Then the normal curvature of M in the direction u_(p) is kappa(u_(p))=S(u_(p))·u_(p), (1) where S is the ...