Abstract. Rényi’s result on the density of integers whose prime factorizations have excess multiplicity has an analogue for polynomials over a finite field. Let n = pα11 · · · pαrr be the prime factorization of a positive integer n. Define the excess of n to be (α1−1)+ · · ·+(αr−1), which is the difference between the total multiplicity α1 + · · · + αr and the number of distinct primes in the factorization. An integer with excess 0 is also said to be square-free. Let Ek denote the set of positive integers of excess k, k = 0, 1, 2,.... Rényi proved that the set Ek has a density dk and that the sequence {dk} has a generating function given by∑ k≥0 dkz k
For each integer n ≥ 2, let P(n) denote its largest prime factor. Let S:= {n ≥ 2: n does not divide ...
International audienceThe Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials wit...
summary:A classical result in number theory is Dirichlet's theorem on the density of primes in an ar...
A primitive set is one in which no element of the set divides another. Erdős conjectured that the su...
Let §P^+ (n) §denote the largest prime factor of the integer §n§ and §P ^+ y (n)§ denote the largest...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractWe derive a formula for the density of positive integers satisfying a certain system of ineq...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractThe condition Σk<x|Σn<x (χ(n) − z)4Ω(n)n| = o(√logx), where Ω(n) stands for the number of pr...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
Abstract. Let S = {a1, a2, · · · , a`} be a finite set of non-zero integers. Re-cently, R. Balasu...
Denote by P + (n) the largest prime factor of an integer n. One of Erdős-Turán's conjectures asserts...
summary:A classical result in number theory is Dirichlet's theorem on the density of primes in an ar...
We find the generating function for the number of k-tuples of monic polynomials of degree n over Fq ...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
For each integer n ≥ 2, let P(n) denote its largest prime factor. Let S:= {n ≥ 2: n does not divide ...
International audienceThe Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials wit...
summary:A classical result in number theory is Dirichlet's theorem on the density of primes in an ar...
A primitive set is one in which no element of the set divides another. Erdős conjectured that the su...
Let §P^+ (n) §denote the largest prime factor of the integer §n§ and §P ^+ y (n)§ denote the largest...
AbstractErdős and Sárkőzy proposed the problem of determining the maximal density attainable by a se...
AbstractWe derive a formula for the density of positive integers satisfying a certain system of ineq...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
AbstractThe condition Σk<x|Σn<x (χ(n) − z)4Ω(n)n| = o(√logx), where Ω(n) stands for the number of pr...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
Abstract. Let S = {a1, a2, · · · , a`} be a finite set of non-zero integers. Re-cently, R. Balasu...
Denote by P + (n) the largest prime factor of an integer n. One of Erdős-Turán's conjectures asserts...
summary:A classical result in number theory is Dirichlet's theorem on the density of primes in an ar...
We find the generating function for the number of k-tuples of monic polynomials of degree n over Fq ...
AbstractLet p1,p2,… be the sequence of all primes in ascending order. The following result is proved...
For each integer n ≥ 2, let P(n) denote its largest prime factor. Let S:= {n ≥ 2: n does not divide ...
International audienceThe Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials wit...
summary:A classical result in number theory is Dirichlet's theorem on the density of primes in an ar...