A positive integer is picked randomly from 10^(10^61) to 10^(10^70), inclusive. What is the probability that it is prime?
but numerator is negative, denominator is positive?
i would not bet a stick of gum that the answer is right
well that is wrong! yikes
\[\pi(n)\approx \frac{n}{\log(n)}\] embarrassing too let me get rid of it
let me try the algebra again.
i can't write with all these powers to powers, so lets put \[m=10^{10^{60}}\] \[n=10^{10^{70}}\]
then i guess you estimate at \[\pi(n)-\pi(m)=\frac{m\log(n)-n\log(m)}{mn}\]
so dividing by total number of numbers between them you get \[\frac{m\log(n)-n\log(m)}{mn(n-m)}\] but i have a feeling there is a much better and more sophisticated way to do this
do you know the answer?
i'd say the answer is nearly identical to 1/ln(10^(10^70)) which is less than 1 in 10^70 chance of getting a prime
how did you get it?
when comparing n and m, you might use the fact that n is much bigger than m. try n = 10^(69999999990000..[61 zeros]...0000) * m or something ... rewrite all the algebra so that m/n terms can be discarded when compared to non-(m/n) terms
ah i see
also it might be \[\pi(N) - \pi(M) \approx \frac{N}{\ln(N)} - \frac{M}{\ln(M)}\]and\[\frac{\pi(N) - \pi(M)}{N-M}.\]I would show that second equation is \[\frac{1}{\ln N}\]
Join our real-time social learning platform and learn together with your friends!