Search Results for ""

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Enclose a sphere in a cylinder and cut out a spherical segment by slicing twice perpendicularly to the cylinder's axis. Then the lateral surface area of the spherical segment ...

The word argument is used in several differing contexts in mathematics. The most common usage refers to the argument of a function, but is also commonly used to refer to the ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

There are least two Bang's theorems, one concerning tetrahedra (Bang 1897), and the other with widths of convex domains (Bang 1951). The theorem of Bang (1897) states that ...

A generalization of Fermat's last theorem which states that if a^x+b^y=c^z, where a, b, c, x, y, and z are any positive integers with x,y,z>2, then a, b, and c have a common ...

Birthday attacks are a class of brute-force techniques used in an attempt to solve a class of cryptographic hash function problems. These methods take advantage of functions ...

A Borel set is an element of a Borel sigma-algebra. Roughly speaking, Borel sets are the sets that can be constructed from open or closed sets by repeatedly taking countable ...

A roll of two 6s (the highest roll possible) on a pair of 6-sided dice. The probability of rolling boxcars in a single roll of two dice is 1/36, or 2.777...%. In order to ...

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