English
Related papers

Related papers: Visiting early at prime times

200 papers

Let $\F$ be a family of $r$ integral forms of degree $k\geq 2$ and $\LL=(l_1,\ldots,l_m)$ be a family of pairwise linearly independent linear forms in $n$ variables $\x=(x_1,...,x_n)$. We study the number of solutions $\x\in[1,N]^n$ to the…

Number Theory · Mathematics 2016-07-21 Akos Magyar , Tatchai Titichetrakun

For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive…

Number Theory · Mathematics 2019-01-24 Romeo Meštrović

In this paper we develop the convergence theory of simultaneous, inhomogeneous Diophantine approximation on manifolds. A consequence of our main result is that if the manifold $M \subset \mathbb{R}^n$ is of dimension strictly greater than…

Number Theory · Mathematics 2015-12-17 Victor Beresnevich , Robert C. Vaughan , Sanju Velani , Evgeniy Zorin

Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…

Number Theory · Mathematics 2023-08-25 Sam Chow , Niclas Technau

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

Number Theory · Mathematics 2007-05-23 Damien Roy , Michel Waldschmidt

Let $E\subset [0,1]$ be a set that supports a probability measure $\mu$ with the property that $|\widehat{\mu}(t)|\ll (\log |t|)^{-A}$ for some constant $A>2.$ Let $\mathcal{A}=(q_n)_{n\in \N}$ be a positive, real-valued, lacunary sequence.…

Number Theory · Mathematics 2024-09-06 Bo Tan , Qing-Long Zhou

In this paper we consider the Diophantine equation $x^2+q^{2m}=2y^p$ where $m,p,q,x,y$ are integer unknowns with $m>0,$ $p$ and $q$ are odd primes and $\gcd(x,y)=1.$ We prove that there are only finitely many solutions $(m,p,q,x,y)$ for…

Number Theory · Mathematics 2015-06-26 Szabolcs Tengely

A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…

Classical Analysis and ODEs · Mathematics 2019-09-20 Jonathan M. Fraser

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

Number Theory · Mathematics 2019-02-20 Dimitris Koukoulopoulos

In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…

Number Theory · Mathematics 2019-10-22 Aled Walker

We prove a generalization of W.M. Schmidt's theorem related to the Diophantine approximations for a linear form of the type $\alpha_1x_1+\alpha_2x_2 +y$ with {\it positive} integers $x_1,x_2$.

Number Theory · Mathematics 2011-12-22 Nikolay G. Moshchevitin

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

Number Theory · Mathematics 2023-03-13 John B Friedlander , Henryk Iwaniec

Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…

Combinatorics · Mathematics 2024-01-09 Vitaly Bergelson , Rigoberto Zelada

We describe an algorithm for arbitrary-precision computation of the elementary functions (exp, log, sin, atan, etc.) which, after a cheap precomputation, gives roughly a factor-two speedup over previous state-of-the-art algorithms at…

Numerical Analysis · Mathematics 2022-07-07 Fredrik Johansson

The seminal work of Kurzweil (1955) provides for any fixed badly approximable $\alpha$ and monotonically decreasing $\psi$ a Khintchine-type statement on the set of the inhomogeneous real parameters $\gamma$ for which $\lVert n \alpha +…

Number Theory · Mathematics 2026-03-27 Manuel Hauke

The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…

Dynamical Systems · Mathematics 2015-06-09 Cristian Ghiu , Raluca Tuliga , Constantin Udriste

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

Number Theory · Mathematics 2026-04-03 Stephan Baier , Habibur Rahaman

A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…

Number Theory · Mathematics 2009-08-28 Michel Waldschmidt

We give a necessary condition for the existence of solutions of the Diophantine equation $p=x^{q}+ry^{q},$ with $p$, $q$, $r$ distinct odd prime natural numbers.

Number Theory · Mathematics 2009-07-03 Diana Savin

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by $\mathcal{P}_2(a,q)$ the least almost-prime…

Number Theory · Mathematics 2021-07-20 Jinjiang Li , Min Zhang , Yingchun Cai