Skip to main content
edited title
Link
Will Sawin
  • 148.5k
  • 9
  • 324
  • 563

How many factorsdivisors of $n$ are below $n^{1/3}$?

retitled
Link
user44143
user44143

A bound for the sum $\sum\limits_{\substack{d < n^ How many factors of $n$ are below $n^{1/3} \\ d \mid n}} 1$$?

Asked about a lower bound as well
Source Link

I am trying to bound a function that includes $\sum\limits_{\substack{d < n^{1/3} \\ d \mid n}} 1$.

Is there an upper bound known for this sum, either in general or in terms of $\sum\limits_{\substack{d \mid n}} 1$? Or in general is there a bound for $\sum\limits_{\substack{d < n^{1/k} \\ d \mid n}} 1$? Any help is appreciated.

Edit: I am realizing that a lower bound for this sum in terms of $\sum\limits_{\substack{d \mid n}} 1$ would also be useful if anyone can help with that.

I am trying to bound a function that includes $\sum\limits_{\substack{d < n^{1/3} \\ d \mid n}} 1$.

Is there an upper bound known for this sum, either in general or in terms of $\sum\limits_{\substack{d \mid n}} 1$? Or in general is there a bound for $\sum\limits_{\substack{d < n^{1/k} \\ d \mid n}} 1$? Any help is appreciated.

I am trying to bound a function that includes $\sum\limits_{\substack{d < n^{1/3} \\ d \mid n}} 1$.

Is there an upper bound known for this sum, either in general or in terms of $\sum\limits_{\substack{d \mid n}} 1$? Or in general is there a bound for $\sum\limits_{\substack{d < n^{1/k} \\ d \mid n}} 1$? Any help is appreciated.

Edit: I am realizing that a lower bound for this sum in terms of $\sum\limits_{\substack{d \mid n}} 1$ would also be useful if anyone can help with that.

MathJax: \mid for divisibility
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40
Loading
Source Link
Loading