In PS 1 I can easily generate integers but I can't separate primes from rest of integers.... Any clues?
MIT 6.00 Intro Computer Science (OCW)
Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
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.
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.