Professional Documents
Culture Documents
ON THE NUMBER OF DIVISORS OF N! AND OF THE FIBONACCI NUMBERS
ON THE NUMBER OF DIVISORS OF N! AND OF THE FIBONACCI NUMBERS
1. Introduction
Let d(m) be the number of divisors of the positive integer m. The number
of divisors of n! was studied in the paper [5]. The equation d(n!) = m! was
studied in [6]. More generally, the fractions d(n!)/m! were studied in [1].
Here, we look at positive integers n such that d(n!) is a divisor of n!. Positive
integers m such that d(m) divides m were studied in [8].
Our first result is the following.
Theorem 1.2. The only positive integers n such that d(Fn ) divides Fn
are n ∈ {1, 2, 3, 6, 24, 48}.
For a positive real number x, we write π(x) for the number of primes
p 6 x.
285
286 F. LUCA AND P. T. YOUNG
Thus,
n 6 sq (n) + (q − 1)(sq (n) − 1) = qsq (n) − q + 1 < qsq (n)
(2.4) q 2 log(qn) 3q 2 log n 3q 2 log n
log n
6 q(q − 1) +1 < < = .
log q log q 2 log q log(q 2 )
In the above chain of inequalities, we used aside from the right inequality
(2.2) also the fact that q < n1/2 , therefore qn < n3/2 , so log(qn) < (3/2) log n.
Since 4 6 q 2 6 n/4, and the function x 7→ x/ log x is increasing for x > e,
inequality (2.4) above yields
n 3q 2 3n
< 6 ,
log n log(q 2 ) 4 log(n/4)
leading to log(n/4) < (3/4) log n, or n/4 < n3/4 , or n < 44 = 256, which is
not the case we
√ are considering.
Case 2. n/2 < p 6 n/2.
Let√p1 < p2 < · · · be the increasing sequence of all prime numbers. Let
k := π( n/2) and assume that pk+1 , . . . , pk+s are all the primes in this case,
where k + s = π(n/2). Observe that for such p, we have p3 > n3/2 /8 > n.
Thus,
n n
ap (n) = + 2 ,
p p
and the second integer appearing on the right–hand side above is in {0, 1, 2, 3}.
We pick inductively f (pk+i ) for i = 1, . . . , s to be a positive integer in the
interval I = [(n + 2)/2, n], satisfying the following properties
(i) it is distinct from a2 (n) + 1 = n − s2 (n) + 1;
(ii) it is distinct from f (pk+j ) for all j = 1, . . . , i − 1;
(iii) it is a multiple of apk+i (n) + 1.
Observe that condition (i) says that f (pk+i ) √6= f (2) = a2 (n)+1 = n−s2 (n)+1.
To check that f (pk+i ) 6= f (p) for all p ∈ [3, n/2], observe that for such p we
have that
n − sp (n) n−1 n−1 n+1
f (p) = ap (n)+1 = +1 6 +1 6 +1 = < f (pk+i ).
p−1 p−1 2 2
To justify that we can choose f (pk+i ) as in (i)–(iii) above, it suffices to show
that the number of multiples of apk+i (n) + 1 in [(n + 2)/2, n] exceeds i, since
then one such multiple can be chosen to avoid the single number n − s2 (n) +
1 appearing at (i), and the already chosen i − 1 numbers f (pk+j ) for j =
1, . . . , i − 1. Now since
n−1 n + pk+i − 2
apk+i (n) + 1 6 +1= ,
pk+i − 1 pk+i − 1
288 F. LUCA AND P. T. YOUNG
√ √ !
1+ 5 1− 5
valid for all n > 1, where (α, β) := , are the two roots of
2 2
the characteristic equation x2 − x − 1 = 0 of the sequence of Fibonacci (or
Lucas) numbers.
We also use the well–known fact that Fn is even if and only if n is a
multiple of 3. Furthermore, if n = 3m with m odd, then 2kFn , while if
n = 2a · 3m with some a > 1 and m odd, then 2a+2 kFn .
The main idea for this proof is that if a positive integer m has the property
that the exponent of 2 in the factorization of d(m) is bounded above by some
nonnegative integer K, then m can have at most K distinct primes appearing
at odd exponents in its factorization. In particular, m is a square when K = 0.
Throughout this proof, we use for a square of an integer. It is well–known
that the only positive integers n such that Fn is or 2 are n ∈ {1, 2, 3, 6, 12},
and the only positive integers n such that Ln = or 2 are n ∈ {1, 3, 6} (see
[3, 4]).
After the above preliminaries, we are ready to proceed with the proof
of Theorem 1.2. We use a divide and conquer approach. We divide the set
of potential n such that d(Fn ) | Fn according to the exponent of 2 in the
factorization of Fn .
References
[1] D. Baczkowski, M. Filaseta, F. Luca and O. Trifonov, On rational values of
τ (n!)/m!, φ(n!)/m! and σ(n!)/m!, Int. J. Number Theory 6 (2010), 1199–1214.
[2] K. Broughan, M. González, R. Lewis, F. Luca, V. J. Mejı́a Huguet and A. Togbé,
There are no multiply–perfect Fibonacci numbers, Integers 11A (2011), A7.
[3] J. H. E. Cohn, Fibonacci square numbers, etc., Fibonacci Quarterly 2 (1964), 109–113.
[4] J. H. E. Cohn, Lucas and Fibonacci numbers and some Diophantine equations, Proc.
Glasgow Math. Assoc. 7 (1965), 24–28.
ON THE NUMBER OF DIVISORS OF n! AND OF THE FIBONACCI NUMBERS 293
[5] P. Erdős, S. W. Graham, A. Ivić and C. Pomerance, On the divisors of n!, in Analytic
Number Theory, Proceedings of a Conference in Honor of Heini Halberstam, Vol. 1,
B. Berndt, H. Diamond, A. Hildebrand, eds., Birkhauser, Boston, 1996, 337–355.
[6] F. Luca, Equations involving arithmetic functions of factorials, Divulg. Mat. 8 (2000),
15–23.
[7] J. B. Rosser and L. Schoenfeld, Approximate formulas for some func- tions of prime
numbers, Illinois J. Math. 6 (1962), 64–94.
[8] C. Spiro, How often is the number of divisors of n a divisor of n?, J. Number Theory
21 (1985), 81–100.
F. Luca
Instituto de Matemáticas
Universidad Nacional Autónoma de México
C.P. 58089, Morelia, Michoacán
México
and
The John Knopfmacher Centre
for Applicable Analysis and Number Theory
University of the Witwatersrand
P.O. Wits 2050
South Africa
E-mail : fluca@matmor.unam.mx
P. T. Young
Department of Mathematics
College of Charleston
Charleston, SC 29424
USA
E-mail : paul@math.cofc.edu
Received: 12.9.2011.
Revised: 16.11.2011.