Quote:
Originally Posted by wildrabbitt
Hi,
I understand the iteration sequence of the LucasLehmer test involves using
module (2^p1) arithmetic. How do computers running these such a test cope with numbers with 20+ million digits?

You need a data structure to hold the numbers. The simplest would be a one dimensional
array and a byte or two indicating the most significant bit of the number.
For multiplication you use Fast Fourier Transforms (FFT).
Some of the operations can be parallelized across available cores.
Then there is making things cachefriendly.