Lecture 2

[elz]

Problem set 1: Computing prime numbers, product of primes

This one's a little trickier, so feel free to comment if you run into any problems or want to brainstorm with other people!

(eta: having issues with poll, alas)

Comments

[ex_wicker969]

Man it is times like these when I know how non-mathy my brain is. I got all the primes between 1 and 1000 but my code is ungainly and ugly and I kind of just printed 2, 3, 5, and 7 before I got the ball rolling on the rest by nesting 'if' and n%2!=0, n%3!=0 ... etc.

Anybody else make a pretty ugly program? I'm gonna go try it again at some point tonight. How'd your approach differ from mine?

[ungemmed]

hint: You may want to put the primes in a list as you find them.

[ex_wicker969]

Thank you! I'm giving it another shot and I think I'm starting to get the hang of it.

(I realized I totally got off-track and tried to get an answer the problem didn't ask for.)

pXWMiprUPTOVcxLS

[(Anonymous)]

Weeeee, what a quick and easy souliton.

MoDeXpCzNyFKFCSvSS

[(Anonymous)]

You're the gretaset! JMHO

vqiwThxRBr

[(Anonymous)]

If my problem was a Death Star, this atircle is a photon torpedo.