Abstract
A method that extends existing families of even non-congruent numbers to produce new families of non-congruent numbers with arbitrarily many distinct prime factors is presented. We show that infinitely many new non-congruent numbers can be generated by appending a suitable collection of primes onto any even non-congruent number whose corresponding congruent number elliptic curve has 2-Selmer rank of zero. Our method relies upon Monsky’s formula for computing the 2-Selmer rank of the congruent number elliptic curve. Even non-congruent numbers constructed according to our result have an unlimited number of prime factors in each odd congruence class modulo eight, and have congruent number elliptic curves with 2-Selmer rank equal to zero.
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 callMore From: Rendiconti del Seminario Matematico della Università di Padova
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.
