Here's the question you clicked on:
Muavia
In PS 1 I can easily generate integers but I can't separate primes from rest of integers.... Any clues?
Read carefully pseudo-code in problem set. Wikipedia: "A natural number is called a prime number (or a prime) if it is bigger than one and has no divisors other than 1 and itself." Only odd integers are candidate for prime numbers. Pseudo-code for that you have in the problem set. When you do that, you have candidates for prime numbers. Your next step should be to check if the number is prime. Example: Your number is 5. It's a odd number, so it's your candidate for prime. Next: you check if that number (5) is divisible with 2,3,4. We see it isn't, so the number 5 is prime.
"""Example: Your number is 5. It's a odd number, so it's your candidate for prime. Next: you check if that number (5) is divisible with 2,3,4. We see it isn't, so the number 5 is prime.""" When I write divisible in this sentence I mean that the number has no divisors other than 1 and itself.
Note that when people say "divisible" they really mean "divides into evenly, with a remainder of zero". (Recall the x%a formula from lecture 2 and 3). Now as candidate numbers prove to be primes, you need to add them to "collections" of primes. See lecture 3.
and once it passes the test, you need to record that it is the nth prime number so far, incrementing by 1 each time a candidate passes the test.
that's what i already knew guys... i actually wanted exact code that can get me through
there are plenty of working codes here in the study group, I don't see the value in giving the answer outright and deny you the aha! moment when you figure it out yourself. Someone else might though.