Advertisement
Gamagori

Problem Set 1 Problem 1

Feb 3rd, 2012
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 1.55 KB | None | 0 0
  1. #Problem Set 1
  2. #Name: Grant Gordon
  3. #Collaborators: None
  4. #Time started: 7:51PM
  5. #Time finished:
  6.  
  7. #let's just write something to test if it's a prime number
  8. prime = int
  9. found_primes = 0
  10. current_test = 41
  11. primecount = 1
  12. #This is supposed to check if a number is even or odd. 0 is even, 1 is odd.
  13. def eventest(innumber):
  14.     if (innumber % 2 == 0):
  15.         return 0      #this means it's even
  16.     else:
  17.         return 1      #this means  
  18.  
  19. def primetest(primenumber): #this finds out whether or not a number is prime. only prints primes
  20.     if (eventest(primenumber) == 0):
  21.         asdf = int
  22.     else: #if it's odd, it might be prime
  23.         currentlimit = primenumber/2
  24.         currenttest = 2
  25.         currentanswer = int
  26.         while (currenttest < currentlimit):
  27.             if (primenumber % currenttest == 0): #so if it's not prime
  28.                 currenttest = (currenttest + 999999999) #ends the test
  29.             elif (primenumber % currenttest != 0):
  30.                 currenttest = (currenttest + 1) #keep going
  31.         while (currenttest == currentlimit):
  32.             print (primenumber, "It's prime!")
  33.             currenttest = (currenttest + 1) #finish it
  34.        
  35. #so what I have now - something that checks whether or not a number is prime
  36. #what I need - something that starts at 3 and goes up by one, checking if numbers are prime
  37.  
  38. while (primecount < 1000): #checking everything under 100 for now
  39.     print primetest(primecount)
  40.     primecount = primecount + 1
  41.  
  42. #okay so it's detecting primes properly, but it's not counting them right
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement