Abstract
An asymptotic formula is obtained for the sum of terms σit(n)σ-it(N - n) (t is real) over 0 0. As a consequence, Porter’s result on a power scale for the average number of steps in the Euclidean algorithm is improved.
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.
