Search Results for ""

The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...

The polar curve r=1+2cos(2theta) (1) that can be used for angle trisection. It was devised by Ceva in 1699, who termed it the cycloidum anomalarum (Loomis 1968, p. 29). It ...

Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...

In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...

sum_(1<=k<=n)(n; k)((-1)^(k-1))/(k^m)=sum_(1<=i_1<=i_2<=...<=i_m<=n)1/(i_1i_2...i_m), (1) where (n; k) is a binomial coefficient (Dilcher 1995, Flajolet and Sedgewick 1995, ...

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

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

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

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...