MathDB
Upper bound on d(n)

Source: Kürschak 2008, problem 1

July 6, 2014
number theory unsolvednumber theory

Problem Statement

Denote by d(n)d(n) the number of positive divisors of a positive integer nn. Find the smallest constant cc for which d(n)≤cnd(n)\le c\sqrt n holds for all positive integers nn.
Back to ProblemsView on AoPS