- #1
- 899
- 556
What would be an efficient algorithm for finding pairs of M and N such that ##| M/log(2) - N/log(3) |< \delta## , for some given small ##\delta## ?
Also, such pairs would obviously become scarcer as we reduce ##\delta##, but how does it go quantitatively?
Also, such pairs would obviously become scarcer as we reduce ##\delta##, but how does it go quantitatively?