Search Results for ""

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

A (general) dodecahedron is a polyhedron having 12 faces. Examples include the Bilinski dodecahedron, decagonal prism, elongated square dipyramid (Johnson solid J_(15)), ...

The maximum number of disjoint dominating sets in a domatic partition of a graph G is called its domatic number d(G). The domatic number should not be confused with the ...

The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...

The domino is the unique free (and one-sided) 2-polyomino consisting of two equal squares connected along a complete polygon edge. There are two fixed dominoes.

A theorem proved by Doob (1942) which states that any random process which is both normal and Markov has the following forms for its correlation function C_y(tau), spectral ...