Description: Example: Method 2 with the screening of all prime numbers between 100. Solution: We use the following method to solve this problem: first the establishment of a containing between 2 to 100 the number of all natural numbers table, delete table 2 in the number of multiples (not including 2) and then find the back of the first to be reserved 2 number p (a 3), then delete multiple of p (excluding p) and then find the next number to be reserved (was 5), continue the steps: continue to do so until the P is greater than 100 so far. So that the remaining number of tables is required for all prime numbers. This request is called Ai Latuo prime numbers scattered (Eratosthenes) method.
To Search:
File list (Check if you may need any files):
1.cpp
Download