I'm having a problem with understanding question ps1b. I think it means that you should add the logs of all the primes that come before prime number n. Then divide the sum of the logs by n. But when I do that for 23 & 29 the ratio for 23 is higher than for 29. Here is how I would do that part on the command line:
But the ratio for 23: 0.69946106453043633
Ratio for 29: 0.66286547241824778
What am I missing?
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.
Here is a copy of my actual code:
So in my code if you enter prime 23 and then prime 29 you will see that the ratio for 23 is lower than 29, and my understanding of the problem is that the ratio should always get greater as n gets greater.
After reading several posts here, it seems like most people solved this the same way I did. I'm beginning to think I should just move on, so let me know if you see any problems with my code please.
I meant to say the ratio for 23 is greater than 29.
"... theory that states that for sufficiently large n ...."
maybe 23 and 29 are not sufficiently large
"... the ratio of the sum of the logs of the primes to the value n slowly get closer to 1, it does not approach this limit monotonically. "
I think the second one is your answer