Abstract
We derived an asymptotic formula for the number of pairs of integers which are mutually squares. Earlier results dealt with pairs of integers subject to the restriction that they are both odd, co-prime and squrefree. Here we remove all these restrictions and prove (similar to the best known one with restrictions) that the number of such pair of integers upto a large real X is asymptotic to \(\frac{{c{X^2}}}{{\log X}}\) with an absolute constant c which we give explicitly. Our error term is also compatible to the best known one.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.