#1
Feb1904, 10:38 AM

P: n/a

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. 



#2
Feb1904, 10:52 AM

Sci Advisor
HW Helper
P: 9,398




Register to reply 
Related Discussions  
A scientist’s transmitter emits a wavelength  Special & General Relativity  34  
Proof this inequality using Chebyshev's sum inequality  Calculus & Beyond Homework  1  
nuclear physics job description  Academic Guidance  2  
Curious?  Introductory Physics Homework  3  
spacecraft traveled into space from Earth  General Physics  3 