Official link: https://projecteuler.net/problem=501
Note: Code takes ~240 seconds to run, but i'm very happy with my understanding and solution
After solving Problem 712, and implementing my own efficient Prime Counting Function I searched for other problems with the "prime-counting" tag on Project Euler, and I found this one.
Firstly we use the Divisor Function to understand the problem better
Then to no surprise the Prime Counting Function comes up which allows us to make a very nice solution.
Input an integer (yourinput)
Code will output f(yourinput)