Let r, s, n be integers satisfying and gcd(r, s) = 1. Lenstra showed that the number of integer divisors of n equivalent to r (mod s) is upper bounded by
We re-examine this problem; showing how to explicitly construct all such divisors and incidentally improve this bound to
. Let r, s, n be integers satisfying
and gcd(r, s) = 1. Lenstra showed that the number of integer divisors of n equivalent to r (mod s) is upper bounded by
We re-examine this problem; showing how to explicitly construct all such divisors and incidentally improve this bound to
.
By: Don Coppersmith; Nick Howgrave-Graham; S.V. Nagaraj
Published in: RC23466 in 2004
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .