anonymous
  • anonymous
Could someone take a look at my code for ps1b? Thanks.
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.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
Here is the solution I came up with. It works, but for numbers above 20,000 or so, it can take a little while to compute the answer. I was just wondering if there's a better/faster way to do it? from math import * n = input('Pick a number: ') sum = 0 for number in range(2,n): divisor = 2 while (divisor < (number/2)) and (number % divisor !=0): divisor = divisor + 1 if number % divisor != 0: prime_number = number sum = sum + log(prime_number) print sum + log(2) print n print (sum/n)
anonymous
  • anonymous
Here is all the code, highlighted with comments, if you need it: http://dpaste.com/hold/450061/
anonymous
  • anonymous
Last line, use this : print ((sum+log(2))/n) If not, you are not counting the log of 2 in your ratio and your theorem fails

Looking for something else?

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