怎样收集短一点的英文说明书呢

We shall be considering algorithms for computing algebraic invariants attached to vector spaces
and linear maps over a field F. In applications the field is often that of the real or complex
numbers. In this project F will be GF(p), the finite field of p elements, represented by the
integers modulo p for some prime p. In other words, all arithmetic will be integer arithmetic
done modulo p. In this way the distractions of performing real arithmetic accurately on the
computer will be avoided.
You may assume, for programming purposes, that p will be in practice less than 100, and that
all matrices will have at most 10 rows and 10 columns. However, when answering questions
about complexity for large p you should be thinking about how the program would behave for
very large p (i.e., let p tend to infinity).

比如家里经常买的东西，都附有英文说明书啊，多留心一下有很多哦