I have a 3 radii hexagon and all of the primes line up on the radii associated with 5 and 7. I have another version that opens a file of primes up to 5000 if the square root of a number is larger, it will fill in the primes between. I modified the routine that checks for the prime and added a check for the last digit of 5 in the check with division of 2 because any number that has a 5 will be divisible by 5, and then I'm also testing another qualification if the modulo of the value being checked is 1 or 5, it may be a prime. Both print out the lists of prime values at the conclusion of the run.
Community Contribution
Link to live project, video, or image:
Sharing
[x] I would be happy to have my project shared on The Coding Train's social media!
PWilson-1978
commented
2 years ago
I have a 3 radii hexagon and all of the primes line up on the radii associated with 5 and 7. I have another version that opens a file of primes up to 5000 if the square root of a number is larger, it will fill in the primes between. I modified the routine that checks for the prime and added a check for the last digit of 5 in the check with division of 2 because any number that has a 5 will be divisible by 5, and then I'm also testing another qualification if the modulo of the value being checked is 1 or 5, it may be a prime. Both print out the lists of prime values at the conclusion of the run.
Community Contribution
Link to live project, video, or image:
Sharing
Instagram:
Twitter: