Search Results for ""

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

The Struve function, denoted H_n(z) or occasionally H_n(z), is defined as H_nu(z)=(1/2z)^(nu+1)sum_(k=0)^infty((-1)^k(1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)), (1) where ...

A sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...

By analogy with the sinc function, define the tanc function by tanc(z)={(tanz)/z for z!=0; 1 for z=0. (1) Since tanz/z is not a cardinal function, the "analogy" with the sinc ...

An n-trapezohedron, also called an antidipyramid, antibipyramid, or deltohedron (not to be confused with a deltahedron), is a solid composed of interleaved symmetric ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

A set of positive integers is called weakly triple-free if, for any integer x, the set {x,2x,3x} !subset= S. For example, all subsets of {1,2,3,4,5} are weakly triple-free ...

Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...