Alright
Anyway "Quick's Primality Algorithm" works in 6 steps ( is the # being tested).
1. is a whole #? (if yes, it's not prime. If no, go on)
2. is a whole #? (if yes, it's not prime. If no, go on)
3. is a whole #? (if yes, go to step 5. If no, go to step 4)
4. is a whole #? (if yes, go to step 5. If no, it's not prime)
5. is a whole #? (if yes, it's prime. If no, go to step 6)
6. is a whole #? (if yes, it's prime. If no, it's not prime)