All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2 Next

Displaying 21 – 40 of 84

Showing per page

Power-free values, large deviations, and integer points on irrational curves

Harald A. Helfgott (2007)

Journal de Théorie des Nombres de Bordeaux

Let f ∈ ℤ [ x ] be a polynomial of degree d ≥ 3 without roots of multiplicity d or ( d - 1 ) . Erdős conjectured that, if f satisfies the necessary local conditions, then f ( p ) is free of ( d - 1 ) th powers for infinitely many primes p . This is proved here for all f with sufficiently high entropy.The proof serves to demonstrate two innovations: a strong repulsion principle for integer points on curves of positive genus, and a number-theoretical analogue of Sanov’s theorem from the theory of large deviations.

Pretentiousness in analytic number theory

Andrew Granville (2009)

Journal de Théorie des Nombres de Bordeaux

In this report, prepared specially for the program of the XXVième Journées Arithmétiques, we describe how, in joint work with K. Soundararajan and Antal Balog, we have developed the notion of “pretentiousness” to help us better understand several key questions in analytic number theory.

Prime constellations in triangles with binomial coefficient congruences

Larry Ericksen (2009)

Acta Mathematica Universitatis Ostraviensis

The primality of numbers, or of a number constellation, will be determined from residue solutions in the simultaneous congruence equations for binomial coefficients found in Pascal’s triangle. A prime constellation is a set of integers containing all prime numbers. By analyzing these congruences, we can verify the primality of any number. We present different arrangements of binomial coefficient elements for Pascal’s triangle, such as by the row shift method of Mann and Shanks and especially by...

Prime factors of values of polynomials

J. Browkin, A. Schinzel (2011)

Colloquium Mathematicae

We prove that for every quadratic binomial f(x) = rx² + s ∈ ℤ[x] there are pairs ⟨a,b⟩ ∈ ℕ² such that a ≠ b, f(a) and f(b) have the same prime factors and min{a,b} is arbitrarily large. We prove the same result for every monic quadratic trinomial over ℤ.

Prime numbers along Rudin–Shapiro sequences

Christian Mauduit, Joël Rivat (2015)

Journal of the European Mathematical Society

For a large class of digital functions f , we estimate the sums ∑ n ≤ x Λ ( n ) f ( n ) (and ∑ n ≤ x μ ( n ) f ( n ) , where Λ denotes the von Mangoldt function (and μ the Möbius function). We deduce from these estimates a Prime Number Theorem (and a Möbius randomness principle) for sequences of integers with digit properties including the Rudin-Shapiro sequence and some of its generalizations.

Prime numbers with Beatty sequences

William D. Banks, Igor E. Shparlinski (2009)

Colloquium Mathematicae

A study of certain Hamiltonian systems has led Y. Long to conjecture the existence of infinitely many primes which are not of the form p = 2⌊αn⌋ + 1, where 1 < α < 2 is a fixed irrational number. An argument of P. Ribenboim coupled with classical results about the distribution of fractional parts of irrational multiples of primes in an arithmetic progression immediately implies that this conjecture holds in a much more precise asymptotic form. Motivated by this observation, we give an asymptotic...

Currently displaying 21 – 40 of 84