Geodesic
ON THE SQUARE-FREE PARTS OF ⌊en!⌋
Glasgow mathematical journal, Tome 49 (2007) no. 2, pp. 391-403

Voir la notice de l'article provenant de la source Cambridge University Press

In this note, we show that if we write ⌊en!⌋ = s(n)u(n)2, where s(n) is square-free then has at least C log log N distinct prime factors for some absolute constant C > 0 and sufficiently large N. A similar result is obtained for the total number of distinct primes dividing the mth power-free part of s(n) as n ranges from 1 to N, where m ≥ 3 is a positive integer. As an application of such results, we give an upper bound on the number of n ≤ N such that ⌊en!⌋ is a square.
DOI : 10.1017/S0017089507003734
Mots-clés : 11B83, 11D41, 11N36 
LUCA, FLORIAN; SHPARLINSKI, IGOR E. ON THE SQUARE-FREE PARTS OF ⌊en!⌋. Glasgow mathematical journal, Tome 49 (2007) no. 2, pp. 391-403. doi: 10.1017/S0017089507003734
@article{10_1017_S0017089507003734,
     author = {LUCA, FLORIAN and SHPARLINSKI, IGOR E.},
     title = {ON {THE} {SQUARE-FREE} {PARTS} {OF} \ensuremath{\lfloor}en!\ensuremath{\rfloor}},
     journal = {Glasgow mathematical journal},
     pages = {391--403},
     year = {2007},
     volume = {49},
     number = {2},
     doi = {10.1017/S0017089507003734},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089507003734/}
}
TY  - JOUR
AU  - LUCA, FLORIAN
AU  - SHPARLINSKI, IGOR E.
TI  - ON THE SQUARE-FREE PARTS OF ⌊en!⌋
JO  - Glasgow mathematical journal
PY  - 2007
SP  - 391
EP  - 403
VL  - 49
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089507003734/
DO  - 10.1017/S0017089507003734
ID  - 10_1017_S0017089507003734
ER  - 
%0 Journal Article
%A LUCA, FLORIAN
%A SHPARLINSKI, IGOR E.
%T ON THE SQUARE-FREE PARTS OF ⌊en!⌋
%J Glasgow mathematical journal
%D 2007
%P 391-403
%V 49
%N 2
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089507003734/
%R 10.1017/S0017089507003734
%F 10_1017_S0017089507003734

[1] 1. Balasurya, S., Luca, F. and Shparlinski, I. E., Prime divisors of some recurrence sequence, Per. Math. Hungarica, to appear. Google Scholar

[2] 2. Bennett, M. A., Rational approximations to algebraic numbers of small height: the Diophantine equation |ax n −by n |=1, J. Reine Angew. Math. 535 (2001), 1–49. Google Scholar | DOI

[3] 3. Everest, G., Poorten, A. van der, Shparlinski, I. and Ward, T., Recurrence sequences, Mathematical Surveys and Monographs (Amer. Math. Soc., Providence, RI, 2003). Google Scholar | DOI

[4] 4. Evertse, J.-H., Schlickewei, H. P. and Schmidt, W. M., Linear equations in variables which lie in a multiplicative group, Ann. Math. 155 (2002), 807–836. Google Scholar | DOI

[5] 5. Garaev, M. Z., Luca, F. and Shparlinski, I. E., Catalan and Apéry numbers in residue classes, J. Combin. Theory Ser. A 113 (2006), 851–865. Google Scholar | DOI

[6] 6. Luca, F., Prime divisors of binary holonomic sequences, Advances in App. Math., to appear. Google Scholar

[7] 7. Nagell, T., On a special class of Diophantine equations of the second degree, Ark. Mat. 3 (1954), 51–65. Google Scholar | DOI

[8] 8. Tenenbaum, G., Introduction to analytic and probabilistic number theory (Cambridge University Press, 1995). Google Scholar

Cité par Sources :