anonymous
  • anonymous
Hey - I finished PS1a with little difficulty, but I'm totally lost with PS1b. I simply don't understand the question. Can someone explain the problem in music-major terms?
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 :)
SOLVED
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.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
I think a big problem is I can't figure out what "e" is.
anonymous
  • anonymous
e is a constant like pi. It's just a number that's useful for figuring out certain kinds of problems. it's value is 2.718... You don't need to know what it is or include it specifically in your code in any way--if you use the log function as in math.log(currentPrimeNumber) it will automatically do the part of the calculation that involves e. You do not need to specify e.
anonymous
  • anonymous
Here's a restatement of the problem that you can use functionally: Find all the primes up to some number which we will call x. That means that if x is 1000, you find all the prime numbers BELOW 1000. It does NOT mean that you find 1000 prime numbers. Add together the logs of those prime numbers. That just means that for each prime, you do the operation math.log(prime) and add the result to the running total. The total of the logs should be close to x. The higher x gets, the closer the sum of the logs should be, generally.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
Okay that makes sense. It seems very similar to the first problem so I should be good from here. Thanks so much!

Looking for something else?

Not the answer you are looking for? Search for more explanations.