Algorithm basis:
N is prime if all prime numbers up to the arithmetic square root of an integer N greater than 1 are not divisible by N.
Data container:
Small array BUFFER, binary file CACHE
Program features:
In theory, very little memory (about 0.5MB) can be used to obtain all prime numbers within the maximum value that can be represented by unsigned long long (the actual number of prime numbers that can be obtained will be restricted by the capacity of the hard disk)