Abstract
Whether or not a relatively prime pair of amicable numbers exists is still an open question. In this paper some necessary conditions for $m$ and $n$ to be a pair of odd relatively prime amicable numbers are proved. In particular, lower bounds for $m$, $n$, $mn$ and the number of prime divisors of $mn$ are established. The arguments are based on an extensive case study carried out on the CDC 6400 at the Temple University Computing Center.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
