<commit_before>#!/usr/bin/env python 3.1
#doesn't work for numbers less than 4 
from math import sqrt 
def nextprime(number): 
	"This function will find the smallest prime larger than the current number"
	potential= number
	j=2
	while j<=sqrt(potential):
        	if potential%j:
			j=j+1
		else:
			#print "not prime"
			potential=potential +1
			j=2
			continue
	#print potential
	return potential 
number =4  
rawstop = raw_input('I want to find all the prime numbers below ')
stop = int(rawstop)
print 2
print 3
while number < stop:
	number = nextprime(number) 
	if number<stop: 
		print number  
	number= number +1 #would changing the one to a two allow me to skip testing even numbers? yes, now its faster 
	continue 
	number = nextprime(number)
print "done"<commit_msg>more efficient, could be more efficient<commit_after>#!/usr/bin/env python 3.1
#doesn't work for numbers less than 4 
from math import sqrt 
def nextprime(number): 
	"This function will find the smallest prime larger than the current number"
	potential= number
	j=3
	while j<=sqrt(potential):
        	if potential%j:
			j=j+2
		else:
			#print "not prime"
			potential=potential +2
			j=3
			continue
	#print potential
	return potential 
number =3
rawstop = raw_input('I want to find all the prime numbers below ')
stop = int(rawstop)
print 2
while number < stop:
	number = nextprime(number) 
	if number<stop: 
		print number  
	number= number +2
	continue 
	number = nextprime(number)
print "done"
{'fraction_non_alphanumeric': 0.08135593220338982, 'fraction_numerical': 0.01423728813559322, 'mean_word_length': 3.839344262295082, 'pattern_counts': {'":': 0, '<': 9, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '63611', 'n_tokens_mistral': 517, 'n_tokens_neox': 459, 'n_words': 186}