I'm Stuck on the second part of ps1-- I don't understand e**n. forgive my ignorance but what is being asked. what is "e" and why are we multiplying primes together?
are we saying that the product of the primes (2*3*5) < 7**7 but those numbers get closer as "n" gets bigger?
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 :)
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.
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
I am not a math pro but, e is a mathematical constant approximately equal to 2.718 (you can find more on wikipedia). e**n means e raised to the power of n (or n times e), where n is a sufficiently large number (let's say 10000 or even bigger. This is just an example though). The pdf pset1 explains the result of a number theory (don't know whose theory). The primes are being multiplied because the theory's result says that (PRODUCT of primes less than n) divided by (e**n) will get closer to 1 as n increases. However, dealing with such big numbers can be challenging. This has been made doable in python by converting the above statement to log form (described in the pdf). That way one wouldn't have to worry about the humongous numbers resulting from multiplication of primes or calculating e**n (both of which are very very large numbers). Hope this helps.
It may be helpful to note that the natural log of e is 1, log(e)=1. Hence the comparison of the sum of log(p) over the primes, p
a cool article on understanding e. Also, to complete the problem, e will not show up literally (you won't have to calculate e in your equations) anywhere in your code, but it is important to understand it and also understand the log function used here is base e, or also ln as you may have seen on your graphing calculator.