Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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)
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
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.

Join Brainly to access

this expert answer

SEE EXPERT ANSWER

To see the expert answer you'll need to create a free account at Brainly

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.

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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.

Not the answer you are looking for?

Search for more explanations.

Ask your own question