I was inspired by this little problem, which I got wrong because I was missing a tiny term in the sum.
So, I pose this question:
Approximate the number of semiprimes less than .
My approximation is
It's really messy and pretty tedious but involves simple calculus and algebra. The estimate is the upper bound of a lower bound.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Thanks for the mention. :D
Cheers for the inspiration, @Finn Hulse. Hope you find this fun.
By "upper bound of a lower bound", do you mean the "greatest lower bound"?
Log in to reply
No, because I don't know if it is the greatest lower bound. All I know is that the lower bound is greater than it's "supposed" to be. This is because I ignored a lnlnx term in an integral I was dealing with.
@Jake Lai Sorry for the mistake. I have edited that problem. I could not reply there I think there is some bug. :)