pset 1 problem 1b. help,
Im confused, i can't understand what the problem im being asked is, i am new to programming and have not heard the log function mentioned in the lecture, am i correct in thinking that as follows
n = number entered by user,
and i need to show that,
all the primes before n, added together, divided by n**2 is less then 1, and as n increases, the answer gets closer to one. (is log another name for exponent? the e**n confused me, surley it would be n ** 2? ) thanks in advance

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

The log function is part of the math module.

logarithm i guess

Looking for something else?

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

## More answers

Looking for something else?

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