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
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.
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 -
Cité par Sources :