http://www.math.missouri.edu/~bbanks/papers/index.htmlLet P(n) denote the largest prime factor of an integer n ≥ 2, and put P(1) = 1. In this paper, we study the distribution of the sequence {P(n) : n ≥ 1} over the set of congruence classes modulo an integer q ≥ 2, and we study the same question for the sequence {P(p − 1) : p is prime}. We also give bounds for rational exponential sums involving P(n). Finally, for an irrational number _, we show that the sequence {_P(n) : n ≥ 1} is uniformly distributed modulo 1
For a fixed integer s ≥ 1, we estimate exponential sums with harmonic sums [equation omitted for for...
AbstractIn this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory...
AbstractFor a real x ≥ 1 we denote by S[x] the set of squarefull integers n ≤x, that is, the set of ...
The distribution of the prime numbers has intrigued number theorists for centuries. As our understan...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
This is a preprint of a book chapter published in High Primes and Misdemeanours: Lectures in Honour ...
Let f be a Rademacher or a Steinhaus random multiplicative function. Let ε>0 small. We prove that, a...
First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by Interna...
Stewart (2013) proved that the biggest prime divisor of the $n$th term of a Lucas sequence of intege...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
AbstractTwo results are obtained about P(n), the largest prime factor of an integer n. The average v...
The Bombieri-Vinogradov theorem for nilsequences, Discrete Analysis 2021:21, 55 pp. The prime numb...
AbstractA regularity in the distribution of the solutions of the congruence f(X1 ,…, Xn) 0 (modp) ...
AbstractIn this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory...
AbstractLet P be a polynomial. We find a necessary and sufficient condition for some subsequences of...
For a fixed integer s ≥ 1, we estimate exponential sums with harmonic sums [equation omitted for for...
AbstractIn this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory...
AbstractFor a real x ≥ 1 we denote by S[x] the set of squarefull integers n ≤x, that is, the set of ...
The distribution of the prime numbers has intrigued number theorists for centuries. As our understan...
AbstractFor a fixed integer s≥2, we estimate exponential sums with alternative power sums As(n)=∑i=0...
This is a preprint of a book chapter published in High Primes and Misdemeanours: Lectures in Honour ...
Let f be a Rademacher or a Steinhaus random multiplicative function. Let ε>0 small. We prove that, a...
First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by Interna...
Stewart (2013) proved that the biggest prime divisor of the $n$th term of a Lucas sequence of intege...
AbstractLet a be an integer ≠−1 and not a square. Let Pa(x) be the number of primes up to x for whic...
AbstractTwo results are obtained about P(n), the largest prime factor of an integer n. The average v...
The Bombieri-Vinogradov theorem for nilsequences, Discrete Analysis 2021:21, 55 pp. The prime numb...
AbstractA regularity in the distribution of the solutions of the congruence f(X1 ,…, Xn) 0 (modp) ...
AbstractIn this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory...
AbstractLet P be a polynomial. We find a necessary and sufficient condition for some subsequences of...
For a fixed integer s ≥ 1, we estimate exponential sums with harmonic sums [equation omitted for for...
AbstractIn this paper, we prove two results. The first theorem uses a paper of Kim (J. Number Theory...
AbstractFor a real x ≥ 1 we denote by S[x] the set of squarefull integers n ≤x, that is, the set of ...