Name:Unknown
Clan:Unknown
Member Since:Mar 2019
Last Seen:Dec 2020
Profiles:
Following:0
Followers:0
Allies:0
This is a first experiment of mine in generating primes. Theoretically, with enough calculating power and storage space you could find primes indefinitely. I cribbed some of the guts from another work and justled them around a bit. Advice welcome.
def primemaker(x):
primes = []
isprime = True
for possibleprimes in range(2,x):
for n in range(2,possibleprimes):
if possibleprimes % num == 0:
isprime = False
if isprime:
primes.append(possibleprimes)
print(primes)# TODO: Replace examples and use TDD development by writing your own tests
# These are some of the methods available:
# test.expect(boolean, [optional] message)
# test.assert_equals(actual, expected, [optional] message)
# test.assert_not_equals(actual, expected, [optional] message)
# You can use Test.describe and Test.it to write BDD style test groupings