Search Results for ""

A discriminant is a quantity (usually invariant under certain classes of transformations) which characterizes certain properties of a quantity's roots. The concept of the ...

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 dot plot, also called a dot chart, is a type of simple histogram-like chart used in statistics for relatively small data sets where values fall into a number of discrete ...

The Drazin inverse is a matrix inverse-like object derived from a given square matrix. In particular, let the index k of a square matrix be defined as the smallest ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

Engineering notation is a version of scientific notation in which the exponent p in expressions of the form a×10^p is chosen to always be divisible by 3. Numbers of forms ...

The Erdős number is the number of "hops" needed to connect the author of a paper with the prolific late mathematician Paul Erdős. An author's Erdős number is 1 if he has ...

The "imaginary error function" erfi(z) is an entire function defined by erfi(z)=-ierf(iz), (1) where erf(z) is the erf function. It is implemented in the Wolfram Language as ...

The even part Ev(n) of a positive integer n is defined by Ev(n)=2^(b(n)), where b(n) is the exponent of the exact power of 2 dividing n. The values for n=1, 2, ..., are 1, 2, ...