Article contents
ON THE SQUARE-FREE PARTS OF ⌊en!⌋
Published online by Cambridge University Press: 09 August 2007
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 2007
References
REFERENCES
- 1
- Cited by