On the Parity of the Number of Small Divisors of n

Kevin Ford (), Florian Luca (), Carl Pomerance () and Jeffrey Shallit ()
Additional contact information
Kevin Ford: University of Illinois at Urbana–Champaign, Department of Mathematics
Florian Luca: University of the Witwatersrand, School of Mathematics
Carl Pomerance: Dartmouth College, Department of Mathematics
Jeffrey Shallit: University of Waterloo, School of Computer Science

A chapter in Analytic Number Theory, 2015, pp 93-100 from Springer

Abstract: Abstract For a positive integer j we look at the parity of the number of divisors of n that are at most j, proving that for large j, the count is even for most values of n.

Keywords: Number; of; divisors; 11N25; 20K01 (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-22240-0_6

Ordering information: This item can be ordered from
http://www.springer.com/9783319222400

DOI: 10.1007/978-3-319-22240-0_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().