Results 1  10
of
13
The number of solutions of Φ(x) = m
"... An old conjecture of Sierpiński asserts that for every integer k � 2, there is a number m for which the equation φ(x) = m has exactly k solutions. Here φ is Euler’s totient function. In 1961, Schinzel deduced this conjecture from his Hypothesis H. The purpose of this paper is to present an uncondit ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
An old conjecture of Sierpiński asserts that for every integer k � 2, there is a number m for which the equation φ(x) = m has exactly k solutions. Here φ is Euler’s totient function. In 1961, Schinzel deduced this conjecture from his Hypothesis H. The purpose of this paper is to present an unconditional proof of Sierpiński’s conjecture. The proof uses many results from sieve theory, in particular the famous theorem of Chen.
An uncertainty principle for arithmetic sequences, preprint, available from www.arxiv.org
"... Abstract. Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are “welldistributed ” in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to equidistribution, as have Fourier analysts when wor ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. Analytic number theorists usually seek to show that sequences which appear naturally in arithmetic are “welldistributed ” in some appropriate sense. In various discrepancy problems, combinatorics researchers have analyzed limitations to equidistribution, as have Fourier analysts when working with the “uncertainty principle”. In this article we find that these ideas have a natural setting in the analysis of distributions of sequences in analytic number theory, formulating a general principle, and giving several examples. 1.
COMMON VALUES OF THE ARITHMETIC FUNCTIONS φ AND σ
"... ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s totient function and σ is the sumofdivisors function. This proves a 50year old conjecture of Erdős. Moreover, we show that there are infinitely many integers n such that φ(a) = n and σ(b) = n each ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
ABSTRACT. We show that the equation φ(a) = σ(b) has infinitely many solutions, where φ is Euler’s totient function and σ is the sumofdivisors function. This proves a 50year old conjecture of Erdős. Moreover, we show that there are infinitely many integers n such that φ(a) = n and σ(b) = n each have more than n c solutions, for some c> 0. The proofs rely on the recent work of the first two authors and Konyagin on the distribution of primes p for which a given prime divides some iterate of φ at p, and on a result of HeathBrown connecting the possible existence of Siegel zeros with the distribution of twin primes. 1.
ADDITIVE PROBLEMS WITH PRIME VARIABLES THE CIRCLE METHOD OF HARDY, RAMANUJAN AND LITTLEWOOD
"... ABSTRACT. In these lectures we give an overview of the circle method introduced by Hardy and Ramanujan at the beginning of the twentieth century, and developed by Hardy, Littlewood and Vinogradov, among others. We also try and explain the main difficulties in proving Goldbach’s conjecture and we giv ..."
Abstract
 Add to MetaCart
ABSTRACT. In these lectures we give an overview of the circle method introduced by Hardy and Ramanujan at the beginning of the twentieth century, and developed by Hardy, Littlewood and Vinogradov, among others. We also try and explain the main difficulties in proving Goldbach’s conjecture and we give a sketch of the proof of Vinogradov’s threeprime Theorem. 1. ADDITIVE PROBLEMS In the last few centuries many additive problems have come to the attention of mathematicians: famous examples are Waring’s problem and Goldbach’s conjecture. In general, an additive problem can be expressed in the following form: we are given s ≥ 2 subsets of the set of natural numbers N, not necessarily distinct, which we call A1,..., As. We would like to determine the number of solutions of the equation n = a1 + a2 + ·· · + as (1.1) for a given n ∈ N, with the constraint that a j ∈ A j for j = 1,..., s, or, failing that, we would like to prove that the same equation has at least one solution for “sufficiently large ” n. In fact, we can not expect, in general, that for very small n there will be a solution of equation (1.1). Furthermore, depending on the nature of the sets A j, there may be some arithmetical constraints
ON PRIMES REPRESENTED BY QUADRATIC POLYNOMIALS
, 2008
"... Abstract. This is a survey article on the HardyLittlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture. ..."
Abstract
 Add to MetaCart
Abstract. This is a survey article on the HardyLittlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.
SUMS OF PRIMES AND SQUARES OF PRIMES IN SHORT INTERVALS
, 801
"... Abstract. Let H2 denote the set of even integers n ̸ ≡ 1 (mod 3). We prove that when H ≥ X 0.33, almost all integers n ∈ H2 ∩ (X, X + H] can be represented as the sum of a prime and the square of a prime. We also prove a similar result for sums of three squares of primes. 1. ..."
Abstract
 Add to MetaCart
Abstract. Let H2 denote the set of even integers n ̸ ≡ 1 (mod 3). We prove that when H ≥ X 0.33, almost all integers n ∈ H2 ∩ (X, X + H] can be represented as the sum of a prime and the square of a prime. We also prove a similar result for sums of three squares of primes. 1.
BUBBLES OF CONGRUENT PRIMES
"... Abstract. In [15], Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent to a modulo q. We generalize Shiu’s theorem to imaginary quadratic fields, where we prove the existence of “bubbles ” containing arbi ..."
Abstract
 Add to MetaCart
Abstract. In [15], Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent to a modulo q. We generalize Shiu’s theorem to imaginary quadratic fields, where we prove the existence of “bubbles ” containing arbitrarily many primes which are all, up to units, congruent to a modulo q. 1.