1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Curious Inequality

  1. Feb 19, 2004 #1
    I know that this isn’t very practical but I discovered the following curious inequality when I was playing around with [tex]d(n)[/tex] where [tex]d(n)[/tex] gives the number of divisors of [tex]n \ \epsilon \ N[/tex]. If [tex]n[/tex] has [tex]p[/tex] prime factors (doesn’t have to be distinct prime factors e.g. [tex]12 = 2^2 \ 3 [/tex] has got three prime factors (2,2,3)), Then

    [tex] p + 1 \leq d(n) \leq \sum_{k=0}^{p} _{p} C_{k} [/tex]

    I don’t know if this has been previously discovered but giving its simplicity it wouldn’t surprise me if it has.
    Last edited by a moderator: Feb 19, 2004
  2. jcsd
  3. Feb 19, 2004 #2

    matt grime

    User Avatar
    Science Advisor
    Homework Helper

    the sum you wrote down is just 2^p btw. and isn't that result rather obvious? I mean p distinct primes gives you 2^p divisors, so repeated primes naturally gives you fewer.
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?

Similar Discussions: Curious Inequality
  1. A curious paradox (Replies: 11)

  2. Curious identity? (Replies: 0)

  3. Just curious (Replies: 2)