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.

I don't understand what PS1b is asking for? I have completed PS1a - find the 1000th prime number and gained the correct answer.

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

SIGN UP FOR FREE
ps1b is asking you to first compute logarithms of the prime numbers you just printed , then print sum all the logarithms and then print the ratio of sum of logarithm and the last prime number you just got. it doesn't want you to print ratio of sum and number of prime numbers instead the ratio of sum and last prime number.
yes, jaskaran is right. you take the logarithms of all of the 1000 primes you've calculated, starting with the number two (2) and going all the way to some arbitrary prime number N that is less than your 1000th prime number. you add all of these values (the logarithms of the primes from 2 to N) and compute the ratio of this sum to N. you then repeat this process, making your next-highest prime number the new N, and repeat it again and again until you have reached your 1000th prime. so your first computation will be (log(2) + log(3))/(3), and your second computation will be (log(2) + log(3) + log(5))/(5). so the format is (log(2) + log(3) + ... + log(N))/(N).

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

Not the answer you are looking for?

Search for more explanations.

Ask your own question