Hey Everyone,
I'm currently trying to work through MIT's opencourseware and am using
python. The second assignment they offer is to determine the 1000th prime
number. Below is the code I am using:
#Assignment 1a
#Determine the 1000th prime number
candidate=3
#Already know that 2 is prime
Matty Sarro wrote:
Hey Everyone,
I'm currently trying to work through MIT's opencourseware and am using
python. The second assignment they offer is to determine the 1000th prime
number. Below is the code I am using:
#Assignment 1a
#Determine the 1000th prime number
candidate=3
#Already know
Hey Dave,
Thank you for the heads up. I actually bashed my head against the desk a few
times and eventually I realized what I was doing wrong. Here's my final code
(slightly optimized) that's verified and working. Out of curiousity, what
other optimizations could I throw at it (without diving too
On 10/08/2010 12:57, Matty Sarro wrote:
Hey Everyone,
I'm currently trying to work through MIT's opencourseware and am using
python. The second assignment they offer is to determine the 1000th
prime number. Below is the code I am using:
#Assignment 1a
#Determine the 1000th prime number
Matty Sarro wrote:
Hey Dave,
Thank you for the heads up. I actually bashed my head against the desk a
few times and eventually I realized what I was doing wrong. Here's my
final code (slightly optimized) that's verified and working. Out of
curiousity, what other optimizations could I throw
Matty Sarro wrote:
Hey Dave,
Thank you for the heads up. I actually bashed my head against the desk a few
times and eventually I realized what I was doing wrong. Here's my final code
(slightly optimized) that's verified and working. Out of curiousity, what
other optimizations could I throw at it
