Results 1 
4 of
4
On values taken by the largest prime factor of shifted primes
 Journal of the Australian Mathematical Society
"... Let P denote the set of prime numbers, and let P(n) denote the largest prime factor of an integer n> 1. We show that, for every real number 32/17 < η < (4 + 3 √ 2)/4, there exists a constant c(η)> 1 such that for every integer a � = 0, the set � p ∈ P: p = P(q − a) for some prime q with p η < q < c( ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Let P denote the set of prime numbers, and let P(n) denote the largest prime factor of an integer n> 1. We show that, for every real number 32/17 < η < (4 + 3 √ 2)/4, there exists a constant c(η)> 1 such that for every integer a � = 0, the set � p ∈ P: p = P(q − a) for some prime q with p η < q < c(η) p η � has relative asymptotic density one in the set of all prime numbers. Moreover, in the range 2 ≤ η < (4+3 √ 2)/4, one can take c(η) = 1+ε for any fixed ε> 0. In particular, our results imply that for every real number 0.486 ≤ ϑ ≤ 0.531, the relation P(q − a) ≍ q ϑ holds for infinitely many primes q. We use this result to derive a lower bound on the number of distinct prime divisors of the value of the Carmichael function taken on a product of shifted primes. Finally, we study iterates of the map q ↦ → P(q − a) for a> 0, and show that for infinitely many primes q, this map can be iterated at least (log log q) 1+o(1) times before it terminates. 1.
Lower bounds for the number of smooth values of a polynomial
, 1998
"... We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial from above, a corresponding lower bound of the correct ord ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial from above, a corresponding lower bound of the correct order of magnitude has hitherto been established only in a few special cases. The purpose of this paper is to provide such a lower bound for an arbitrary polynomial. Various generalizations to subsets of the set of values taken by a polynomial are also obtained.
Divisibility, Smoothness and Cryptographic Applications
, 2008
"... This paper deals with products of moderatesize primes, familiarly known as smooth numbers. Smooth numbers play an crucial role in information theory, signal processing and cryptography. We present various properties of smooth numbers relating to their enumeration, distribution and occurrence in var ..."
Abstract
 Add to MetaCart
This paper deals with products of moderatesize primes, familiarly known as smooth numbers. Smooth numbers play an crucial role in information theory, signal processing and cryptography. We present various properties of smooth numbers relating to their enumeration, distribution and occurrence in various integer sequences. We then turn our attention to cryptographic applications in which smooth numbers play a pivotal role. 1 1