I am reading chapter 32 - String Matching from the book "Introduction to Algorithms" 3rd edition Cormen et al. The Rabin-Karp Algorithm is not clear to me despite heaving read it several times. Specifically, when the authors start proposing about some modulo operations for solving some problem, I am unable to follow. To be precise, the paragraphs from
We have intentionally overlooked one problem: p and ts may be too large too work with conveniently...
on till equation 32.2 (pp 991 in 3rd edition) are the paragraphs I am having problems with.
What does "convenient" mean here? Why do they use modulo? I am totally lost. Is it possible to explain this in simple english?
I will appreciate if someone can help me in understanding this paragraph. And if there is any other reference (with similar mathematical treatment) where this can be read, please tell me.