Description: 2 with the screening method available for all prime numbers between 10000 to find out the sequence of the longest arithmetic sequence (continuous and discontinuous two). For example: 3,5,7 for a continuous arithmetic sequence of length 3 with a tolerance of 2 and 7,13,19 for a discrete arithmetic sequence of length 3, tolerance is 6.
To Search:
File list (Check if you may need any files):
findsushu.cpp
readme.txt
Download