Search Results for ""

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

The ditrigonal dodecadodecahedron, also called the ditrigonal dodecahedron, is the uniform polyhedron with Maeder index 41 (Maeder 1997), Wenninger index 80 (Wenninger 1989), ...

The divergence theorem, more commonly known especially in older literature as Gauss's theorem (e.g., Arfken 1985) and also known as the Gauss-Ostrogradsky theorem, is a ...

To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...

A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...

A module over a unit ring R is called divisible if, for all r in R which are not zero divisors, every element m of M can be "divided" by r, in the sense that there is an ...

Taking the ratio x/y of two numbers x and y, also written x÷y. Here, x is called the dividend, y is called the divisor, and x/y is called a quotient. The symbol "/" is called ...

Division by zero is the operation of taking the quotient of any number x and 0, i.e., x/0. The uniqueness of division breaks down when dividing by zero, since the product ...

Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Also let R[z]>0 ...

The kissing number of a sphere is 12. This led Fejes Tóth (1943) to conjecture that in any unit sphere packing, the volume of any Voronoi cell around any sphere is at least ...