SHOW:
|
|
- or go back to the newest paste.
| 1 | - | for candiPrimes in range(2,410): #Test Primes Numbers from 2 to 410 |
| 1 | + | def PrintPrimes(): |
| 2 | ||
| 3 | - | NumOfReTimes = 0 #Count how many remainder 0 will show up |
| 3 | + | |
| 4 | for candiPrimes in range(2,410): | |
| 5 | - | while (divisor<=candiPrimes): '''Analogy: Numbers start from 2 / N times if two remainder 0 will show up and the number is Prime''' |
| 5 | + | |
| 6 | NumOfReTimes = 0 | |
| 7 | ||
| 8 | while (divisor<=candiPrimes): | |
| 9 | #print str(candiPrimes) + ' / ' + str(divisor) | |
| 10 | - | if NumOfReTimes == 2: #test if two remainder 0 did show up |
| 10 | + | |
| 11 | NumOfReTimes += 1 | |
| 12 | divisor += 1 | |
| 13 | ||
| 14 | #print ' ' #New Line | |
| 15 | if NumOfReTimes == 2: | |
| 16 | print ' ' + str(candiPrimes), |
