Update docs/src/ideal_interface.md

Co-authored-by: Tommy Hofmann <thofma@gmail.com>

Author: fingolfin

docs/src/ideal_interface.md

@@ -101,7 +101,7 @@ then the following automatically works:
 ```julia
 ==(I::T, J::T) where {T <: NewIdeal}
 ```
-Note that implementing `==` for a Julia type comes means that we have to pr
+Note that implementing `==` for a Julia type means that we have to provide
 a matching `hash` method which preserves the invariant that `I == J` implies `hash(I) == hash(J)`.
 We provide such a method but by necessity it is very conservative and hence does
 not provide good hashing. You may wish to implement a better `hash` methods.