Scribd
Upload
74 views

Several Inequalities About The Number of Positive Divisors of A Natural Number M

This document summarizes several inequalities relating to the number of positive divisors (τ) of natural numbers. It establishes that τ(mn) ≥ τ(m2)τ(n2) for all m,n in N*. Additionally, it proves τ((m,n))τ([m,n]) = τ(m)τ(n) where (m,n) is the greatest common divisor and [m,n] is the least common multiple. Finally, the document shows that τ(mn) ≤ √√n*m + √√m*n for any natural numbers m and n.

Uploaded by

Lazar Mihail
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views

Several Inequalities About The Number of Positive Divisors of A Natural Number M

This document summarizes several inequalities relating to the number of positive divisors (τ) of natural numbers. It establishes that τ(mn) ≥ τ(m2)τ(n2) for all m,n in N*. Additionally, it proves τ((m,n))τ([m,n]) = τ(m)τ(n) where (m,n) is the greatest common divisor and [m,n] is the least common multiple. Finally, the document shows that τ(mn) ≤ √√n*m + √√m*n for any natural numbers m and n.

Uploaded by

Lazar Mihail
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

General Mathematics Vol. 17, No.

1 (2009), 6570

Several inequalities about the number of positive divisors of a natural number m1


Nicuor Minculete1 , Petric Dicu2 s a

Abstract In this paper we intend to establish several properties of the number of positive divisors of a natural number m. Among these,we remark the inequality 2 (mn) (m2 ) (n2 ), for all m, n N .

2000 Mathematics Subject Classication: 11A25 Key words and phrases: prime number, arithmetic inequality, the number of natural divisors of m.

Introduction

For a positive integer m number, we will note (m) the number of positive divisors of m. We remark that: (1) = 1 and if p is a prime number, then (p) = 2 , (p ) = + 1 . In papers [1][5], [7] we nd the following properties of (m): For m = p1 p2 ...pr , m > 1 we have the relation: 1 2 r (1)
1

(m) = (1 + 1)(2 + 1)...(r + 1) .


Received 5 May, 2008 Accepted for publication (in revised form) 10 December, 2008

65

66 If (m, n) = 1, then (2)

Nicuor Minculete,Petric Dicu s a

(mn) = (m) (n) , for all m, n N . For m 2, we have the relation:


m

(3)

(m) =
k=1

m1 m k k

In [6], for m 1, we have (4) In [8] it is shown that (5)

(m) 2 m .

(m) (n) (mn) , for all m, n N . In [9] are establish the following inequalities:

(6) (7)

(m) < m 3 , f or any m > 12 , ln m , f or any m 3 . ln ln m In this paper, we establish some new inequalities for the function . ln (m) < 1, 066

Main results

We can remark several properties of these functions for two natural non-zero numbers, m and n. Theorem 2.1. (8) (9) a) (mn) (m)n , for all m, n N , b) n|m , atunci (n) (m) , for all m, n N . m n

Several inequalities about ...

67

Proof. We will show that (m) m , for all m N . From the inequality (4), (m) 2 m, but m 2 m for m 4, therefore (m) m , m 4 . For m {1, 2, 3} it is easy to see that the inequality is true. From the inequality (5), (m) (n) (mn) , for all m, n N , but (n) n , so (mn) (m)n , for all m, n N . Because n|m, we have m = nd, and from the inequality (8) we obtain (nd) (n)d , which is equivalent with n (m) nd (n) = m (n) . Corollary 2.1. We have (10) a) (m) + (n) (mn) , f or all m, n N , mn m+n m2 (n) + n2 (m) , f or all m, n N . m+n

(11)

b) (mn)

Proof. We apply the inequality (8) and we deduce (m + n) (mn) = m (mn) + n (mn) mn (m) + mn (n) = mn( (m) + (n)) , which means that the proof is complete. Similarly, we prove the inequality (m + n) (mn) = m (mn) + n (mn) m2 (n) + n2 (m) , consequently the inequality (11). Theorem 2.2. (12) ((m, n)) ([m, n]) = (m) (n) , for all m, n N ,

where (m, n) is the greatest common divisor of m and n and [m, n] is the least common multiple of m and n. Proof. Let m and n be two natural non-zero numbers. We will factorize the numbers m and n in prime factors, thus: m = p1 p2 ...pk q1 1 q2 2 ...qs s , n = p1 p2 ...pk r11 r22 ...rt t , qj = rl , for all 1 2 1 2 k k
k s

j {1, ..., s}and f or all l {1, ..., t} , therefore (m) =


k t

(i + 1)
i=1 k j=1

(j +

1) , (n) =
i=1

(i +1)
l=1

(l +1) , we obtain ((m, n)) =


i=1

(min{i , i }+1)

68
k s

Nicuor Minculete,Petric Dicu s a


t

and ([m, n]) =


i=1

(max{i , i } + 1)

(j + 1)
j=1 l=1

(l + 1) , which means

that ((m, n)) ([m, n]) = (m) (n) , f or all m, n N . Theorem 2.3. (13) 2 (mn) (m2 ) (n2 ) , f or all m, n N .
k i=1 k

Proof. We consider m = mn =
i=1 k

p i i

s j=1

qj j , n =

k i=1 k

p i i

t l=1

rll , which means that


s

pi +i i
t

s j=1

qj j
l=1

rll , hence (m) =


k

(i +1)
i=1 j=1 s

(j +1) and (n) =


t

(i +1)
i=1 l=1

(l +1) , therefore (mn) =


i=1 k

(i +i +1)
j=1

(j +1)
l=1

(l +1) ,

so (m) (n) = (mn)

k i i (i + 1)(i + 1) = (mn) 1+ i + i + 1 i + i + 1 i=1 i=1 k s k

(mn) . Because (m2 ) =


i=1 t

(2i + 1)
j=1

(2j + 1) and (n2 ) =


i=1

(2i +

1)
l=1

(2l + 1) , we obtain the equality:


k s k t

(m2 ) (n2 ) =
i=1 k

(2i + 1)
j=1

(2j + 1)
i=1 s

(2i + 1)
l=1 t

(2l + 1) ,

but 2 (mn) =
i=1 2

(i +i +1)2
k 2 2

(j +1)2
j=1 l=1

(l +1)2 . It is easy to see the

equality (mn) = (m ) (n )
i=1 t

2 s j (i + i )2 1+ 1+ (2i + 1)(2i + 1) j=1 2j + 1

1+
l=1

l2 2l + 1

2 j (i + i )2 1 , for all i = 1, k , 1 + (2i + 1)(2i + 1) 2j + 1 l2 1 , for all j = 1, s , 1 + 1 , for all l = 1, t , we obtain 2 (mn) 2l + 1 (m2 ) (n2 ) .

Since 1 +

Theorem 2.4. Let m and n be two natural non-zero numbers, then (mn) n m + m n.

Several inequalities about ...

69

Proof. We apply the inequality (4) for m and n, we have n (m) 2n m and m (n) 2m n . By adding the inequalities, we obtain (14) n (m) + m (n) 2n m + 2m n ,

but using the inequality (8), we have (mn) (m)n and (mn) (n)m , f or all m, n N , we deduce (15) 2 (mn) (m)n + (n)m ,

so, from the inequalities (14) and (15), we obtain the inequality (mn) n m + m n .

References
[1] Acu D., Aritmetic i teoria numerelor, Editura Universitii Lucian as at Blaga din Sibiu, 1999 (in romanian). [2] Alexandru, V. and Goonoiu, N., M., Elemente de teoria numerelor, s Editura Universitii din Bucureti, 1999 (in romanian). at s [3] Creang, I. and col., Introducere in teoria numerelor, Editura Didactic a a i Pedagogic, Bucureti, 1965 (in romanian). s a s [4] Minculete N. i Dicu P.,Concerning the Euler totient, General Mathes matics, vol. 16, No. 1 (2008), 85-91. [5] Panaitopol, L. and Gica, Al., Probleme celebre de teoria numerelor, Editura Universitii din Bucureti, 1998 (in romanian). at s [6] Panaitopol, L. and Gica, Al., O introducere in aritmetic i teoria a s numerelor, Editura Universitii din Bucureti, 2001 (in romanian). at s

70

Nicuor Minculete,Petric Dicu s a

[7] Panaitopol, L. and Gica, Al., Probleme de aritmetic i teoria nua s merelor, Editura GIL, Zalu, 2006 (in romanian). a [8] Sandor, J., Geometric Theorems, Diophantine Equations and Arithmetic Functions, American Research Press, Rehoboth, 2002. [9] -http://www.nationmaster.com/encyclopedia
1

University Dimitrie Cantemir of Braov s Department of REI Str. Bisericii Romne, Nr. 107, a Braov, Romania. s E-mail address: [email protected]
2

University Lucian Blaga of Sibiu Department of Mathematics Str. Dr. I. Ratiu, Nr. 57, 550012 - Sibiu, Romania. E-mail address: [email protected]

You might also like