AbstractIn a previous paper [1] we proved that when n + 1 is prime. In this paper we prove that when n − 1 is a prime power, and when n ⩾ 3 is a prime power. We give explicit constructions of n-tuples (z1,..... zn) which we prove are global minima for these problems. These are two of the few times in Turán power sum theory where solutions in the inf max problem can be explicitly calculated.07200
AbstractLet Nm(x) be the number of arithmetic progressions that consist of m terms, all primes and n...
This short note provides a sharper upper bound of a well known inequality for the sum of divisors fu...
It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers ...
AbstractLet z1, z2, …, zn be complex numbers, and for j ⩾ 1 define Sj = zj1 + … + zj1. Let Rn=minz1,...
AbstractIf n is a positive integer, we write n! as a product of n prime powers, each at least as lar...
We obtain a lower bound for the minimum over positive integers such that the sum of certain powers o...
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
Let K be a number field, S be the set of primes of K above 2 and T the subset of primes above 2 havi...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
concerning the upper est’imate of.&f(n) = max N(12,x) = max j 2 p(d) /. * t din d<z Previo...
Let (ck) k∈ℕ be a sequence of integers satisfying that Ck ≥ 2 for every k∈ℕ and lim⁻ k→∞ ck = ∞. We ...
41 pagesInternational audienceIf n is a positive integer, let h(n) denote the maximal value of the p...
AbstractA lower bound of Richert on the number of solutions of N − p = P3 is improved
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135594/1/plms0770.pd
AbstractLet Nm(x) be the number of arithmetic progressions that consist of m terms, all primes and n...
This short note provides a sharper upper bound of a well known inequality for the sum of divisors fu...
It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers ...
AbstractLet z1, z2, …, zn be complex numbers, and for j ⩾ 1 define Sj = zj1 + … + zj1. Let Rn=minz1,...
AbstractIf n is a positive integer, we write n! as a product of n prime powers, each at least as lar...
We obtain a lower bound for the minimum over positive integers such that the sum of certain powers o...
AbstractWe define h(n) to be the largest function of n such that from any set of n nonzero integers,...
Let K be a number field, S be the set of primes of K above 2 and T the subset of primes above 2 havi...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
concerning the upper est’imate of.&f(n) = max N(12,x) = max j 2 p(d) /. * t din d<z Previo...
Let (ck) k∈ℕ be a sequence of integers satisfying that Ck ≥ 2 for every k∈ℕ and lim⁻ k→∞ ck = ∞. We ...
41 pagesInternational audienceIf n is a positive integer, let h(n) denote the maximal value of the p...
AbstractA lower bound of Richert on the number of solutions of N − p = P3 is improved
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135594/1/plms0770.pd
AbstractLet Nm(x) be the number of arithmetic progressions that consist of m terms, all primes and n...
This short note provides a sharper upper bound of a well known inequality for the sum of divisors fu...
It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers ...