Understanding Lower Bounds of the Prime Counting Function of pi(y)-pi(x)

To bound f-g by using bounds of f and g, you'll need lower bound of f and _upper_ bound of g to get lower bound of f-g. Simply by knowing f>f0 and g>g0 you know nothing about f-g
by

0 like 0 dislike