Multiple root
In mathematics, the multiplicity of a member of a multiset is the number of times it appears in the multiset. For example, the number of times a given polynomial equation has a root at a given point.
The notion of multiplicity is important to be able to count correctly without specifying exceptions (for example, double roots counted twice). Hence the expression, "counted with multiplicity".
If multiplicity is ignored, this may be emphasized by counting the number of distinct elements, as in "the number of distinct roots". However, whenever a set (as opposed to multiset) is formed, multiplicity is automatically ignored, without requiring use of the term "distinct".
In the prime factorization, for example,
the multiplicity of the prime factor 2 is 2, while the multiplicity of each of the prime factors 3 and 5 is 1. Thus, 60 has 4 prime factors, but only 3 distinct prime factors.
Let F be a field and p(x) be a polynomial in one variable and coefficients in F. An element a ∈ F is called a root of multiplicity k of p(x) if there is a polynomial s(x) such that s(a) ≠ 0 and p(x) = (x − a)ks(x). If k = 1, then a is called a simple root. If k ≥ 2, then a is called a multiple root.
For instance, the polynomial p(x) = x3 + 2x2 − 7x + 4 has 1 and −4 as roots, and can be written as p(x) = (x + 4)(x − 1)2. This means that 1 is a root of multiplicity 2, and −4 is a 'simple' root (of multiplicity 1). Multiplicity can be thought of as "How many times does the solution appear in the original equation?".
The derivative of a polynomial has a multiplicity n - 1 at a root of multiplicity n of the polynomial. The discriminant of a polynomial is zero if and only if the polynomial has a multiple root.
...
Wikipedia