MIT OpenCourseWare 6.00 Introduction to Computer Science and Programming: Lesson 2, HW 1
#Problem Set 1a
#Name:Saouka
#Collaborators: None
#Time: 1:30
global chkprime
chkprime = 12
CurrentNumber = 3
PrimesRequested = 10000 #Ignoring 2 as a prime in the algorithm, accounting for that here.
def checkprime(CurrentNumber):
x = 2
while x < CurrentNumber:
if CurrentNumber%x == 0:
global chkprime
chkprime=0
return CurrentNumber,chkprime
x=x+1
global chkprime
chkprime = 1
print CurrentNumber
return CurrentNumber,chkprime
while 0 < PrimesRequested:
checkprime(CurrentNumber)
if chkprime == 1:
PrimesRequested = PrimesRequested -1
CurrentNumber = CurrentNumber +2
else:
CurrentNumber = CurrentNumber +2
print CurrentNumber -2
#Problem Set 1b
#Name:Saouka
#Collaborators: None
#Time: 1:30
from math import *
global chkprime
chkprime = 12
CurrentNumber = 3
Numbertotal = input('What is N?')
global sumoflog
sumoflog = log(2)
def checkprime(CurrentNumber):
x = 2
while x < CurrentNumber:
if CurrentNumber%x == 0:
global chkprime
chkprime=0
return CurrentNumber,chkprime
x=x+1
global chkprime
chkprime = 1
global sumoflog
sumoflog = sumoflog + log(CurrentNumber)
return CurrentNumber,chkprime
while CurrentNumber < (Numbertotal):
checkprime(CurrentNumber)
CurrentNumber = CurrentNumber +2
print ' The Sum of Logs is', sumoflog
print 'N is', Numbertotal
print 'The Ratio is', sumoflog/Numbertotal
Saouka
2 years ago