Sufficient condition for a matrix to be diagonalizable and similar matrices
First a comment
The wording Number of eigenvectors equals to number of eigenvalues... is confusing. If $A$ has a non zero eigenvector then $A$ has an infinite number of eigenvectors (providing you work in $\mathbb R$ or $\mathbb C$ for example). A proper wording would be $A$ has a basis of eigenvectors.
If a matrix has a row of $0$'s (one of its eigenvalues is $0$), That matrix is diagonalizable?
The implication "If a matrix has a row of $0$'s" then "that matrix is diagonalizable" is not true. The matrix $$A=\begin{pmatrix} 0 & 0\\ 1 & 0 \end{pmatrix}$$ is an example. The only eigenspace is $\mathbb F e_2$ were $e_2$ is the second vector of the canonical basis (and $\mathbb F$ the field of the vector space).
Some equivalent conditions for a matrix $A$ to be diagonalizable
- The sum of the dimensions of its eigenspaces is equal to the dimension $n$ of the space.
- $A$ is similar to a diagonal matrix.
- Its minimal polynomial is a product of distinct linear factors.
If a $n\times n$ matrix has $n$ distinct eigenvalues, then it is automatically diagonalizable. Otherwise, compute the dimension of each eigenspace. The matrix is diagonalizabel if and only if the sum of these dimensions is $n$.
Concerning the sentence “There exists a matrix $B$ and a diagonal matrix $D$ such that: $D=B^{−1}AB$”, well… That's basically what being a diagonalizable matrix means.
The statement "matrix $A$ ($n×n$), is diagonalizable if: number of eigenvectors equals to number of eigenvalues" is not correct.
We would say that a matrix $A$ ($n×n$), is diagonalizable if and only if the sum of the dimension of eigenspaces is equal to $n$, that is if and only if for any eigenvalues the algebraic multiplicity is equal to the geometric multiplicity.
When a matrix is diagonalizable, of course, by definition the diagonal form is similar to the original matrix. Note that similarity holds, more in general, also with the Jordan normal form when the matrix is not diagonalizable.