Show simple item record

An asymptotic estimate related to Selberg's sieve

dc.contributor.authorGraham, S.en_US
dc.date.accessioned2006-04-07T17:03:17Z
dc.date.available2006-04-07T17:03:17Z
dc.date.issued1978-02en_US
dc.identifier.citationGraham, S. (1978/02)."An asymptotic estimate related to Selberg's sieve." Journal of Number Theory 10(1): 83-94. <http://hdl.handle.net/2027.42/22663>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WKD-4CRMCMJ-9/2/0f108a9e611286e8881ec5cd495e9cb4en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/22663
dc.description.abstractSuppose 1 z1 z2 N, and let [Lambda]i(d) = [mu](d) max(log(zi/d), 0) for i = 1, 2. We show that We then use this to improve a result of Barban-Vehov which has applications to zero-density theorems.en_US
dc.format.extent396586 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleAn asymptotic estimate related to Selberg's sieveen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor Michigan 48109, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/22663/1/0000216.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0022-314X(78)90010-0en_US
dc.identifier.sourceJournal of Number Theoryen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.