Akbal, Y.2019-02-212019-02-2120180026-9255http://hdl.handle.net/11693/50350An integer is called y-rough if it is composed solely of primes CloseSPigtSPi y. Let ⌊. ⌋ be the floor function. In this paper, we exhibit an asymptotic formula for the counting function of integers n⩽ x such that ⌊ nc⌋ is y-rough uniformly for a range of y that depends on 1 OpenSPiltSPi cOpenSPiltSPi 2229 / 1949.EnglishExponential sumsPiatetski-Shapiro sequencesRough numbersArticle10.1007/s00605-016-0993-y