Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #Problem Set 1
- #Name: Grant Gordon
- #Collaborators: None
- #Time started: 7:51PM
- #Time finished:
- #let's just write something to test if it's a prime number
- prime = int
- found_primes = 0
- current_test = 41
- primecount = 1
- #This is supposed to check if a number is even or odd. 0 is even, 1 is odd.
- def eventest(innumber):
- if (innumber % 2 == 0):
- return 0 #this means it's even
- else:
- return 1 #this means
- def primetest(primenumber): #this finds out whether or not a number is prime. only prints primes
- if (eventest(primenumber) == 0):
- asdf = int
- else: #if it's odd, it might be prime
- currentlimit = primenumber/2
- currenttest = 2
- currentanswer = int
- while (currenttest < currentlimit):
- if (primenumber % currenttest == 0): #so if it's not prime
- currenttest = (currenttest + 999999999) #ends the test
- elif (primenumber % currenttest != 0):
- currenttest = (currenttest + 1) #keep going
- while (currenttest == currentlimit):
- print (primenumber, "It's prime!")
- currenttest = (currenttest + 1) #finish it
- #so what I have now - something that checks whether or not a number is prime
- #what I need - something that starts at 3 and goes up by one, checking if numbers are prime
- while (primecount < 1000): #checking everything under 100 for now
- print primetest(primecount)
- primecount = primecount + 1
- #okay so it's detecting primes properly, but it's not counting them right
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement