…multiplication and read up on whatever unknowns you encounter. In particular I think some abstract algebra (e.g. Dummit-Foote) would be helpful. There are tons of good expositions on the FFT-way, e.g. check out "Prime Numbers - A Computational Perspective" by Crandall-Pomerance see ch. 9, Fast algorithms for large-integer arithmetic
……阶梯……我隐约记得好像有一种用于生成斐波那契数或卢卡斯数的“已知最快”方法……但 Google 查不出来。我很确定是在这本书里看到的：https://www.amazon.co.uk/Prime-Numbers-Computational-Carl-Po... 下次手头有这本书的时候我得去翻翻看。:)
…ladder... i seemed to recall there is a 'fastest known' method for generating fibonacci or lucas numbers... but google is not helping me. pretty sure i had seen it in this book: https://www.amazon.co.uk/Prime-Numbers-Computational-Carl-Po... i'll have to check when i have access to it next. :)
……数学家。在那段时期，推动 GIMPS 效率提升的主要技术突破都是由 Richard E. Crandall（https://en.wikipedia.org/wiki/Richard_Crandall）做出的，他还和 Carl Pomerance（https://en.wikipedia.org/wiki/Carl_Pomerance）合著了《Prime Numbers: A Computational Perspective》。要是这些家伙是想帮政府垄断数论方面的专业技术和……
…mathematicians. In that timeframe, the main technical advances that helped GIMPS get more efficient were being made by Richard E. Crandall (https://en.wikipedia.org/wiki/Richard_Crandall), who also wrote Prime Numbers: A Computational Perspective with Carl Pomerance (https://en.wikipedia.org/wiki/Carl_Pomerance). If these folks are trying to help governments keep a monopoly on expertise about number theory and the…
……乘法，碰上不懂的概念就去查资料补课。尤其是像抽象代数（比如 Dummit-Foote 那本）我觉得会很有帮助。关于 FFT 方法的优秀讲解有一大堆，比如去看看 Crandall 和 Pomerance 写的《Prime Numbers - A Computational Perspective》，翻翻第9章，关于大整数算术的快速算法。
…multiplication and read up on whatever unknowns you encounter. In particular I think some abstract algebra (e.g. Dummit-Foote) would be helpful. There are tons of good expositions on the FFT-way, e.g. check out "Prime Numbers - A Computational Perspective" by Crandall-Pomerance see ch. 9, Fast algorithms for large-integer arithmetic
……阶梯……我隐约记得好像有一种用于生成斐波那契数或卢卡斯数的“已知最快”方法……但 Google 查不出来。我很确定是在这本书里看到的：https://www.amazon.co.uk/Prime-Numbers-Computational-Carl-Po... 下次手头有这本书的时候我得去翻翻看。:)
…ladder... i seemed to recall there is a 'fastest known' method for generating fibonacci or lucas numbers... but google is not helping me. pretty sure i had seen it in this book: https://www.amazon.co.uk/Prime-Numbers-Computational-Carl-Po... i'll have to check when i have access to it next. :)
……数学家。在那段时期，推动 GIMPS 效率提升的主要技术突破都是由 Richard E. Crandall（https://en.wikipedia.org/wiki/Richard_Crandall）做出的，他还和 Carl Pomerance（https://en.wikipedia.org/wiki/Carl_Pomerance）合著了《Prime Numbers: A Computational Perspective》。要是这些家伙是想帮政府垄断数论方面的专业技术和……
…mathematicians. In that timeframe, the main technical advances that helped GIMPS get more efficient were being made by Richard E. Crandall (https://en.wikipedia.org/wiki/Richard_Crandall), who also wrote Prime Numbers: A Computational Perspective with Carl Pomerance (https://en.wikipedia.org/wiki/Carl_Pomerance). If these folks are trying to help governments keep a monopoly on expertise about number theory and the…