Search arXivSearch

arXiv · 2312.02775

On the distribution of $αp^2$ modulo one in the intersection of two Piatetski--Shapiro sets

Abstract

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<γ_2<γ_1<1$ are two fixed constants. In this paper, it is proved that, whenever $α$ is an irrational number and $β$ is any real number, there exist infinitely many prime numbers $p$ in the intersection of two Piatetski--Shapiro sets, i.e., $p=\lfloor n_1^{1/γ_1}\rfloor=\lfloor n_2^{1/γ_2}\rfloor$, such that \begin{equation*} \|αp^2+β\|<p^{-\frac{14(γ_1+γ_2)-27}{43}+\varepsilon}, \end{equation*} provided that $27/14<γ_1+γ_2<2$. This result constitutes an generalization upon the previous result of Dimitrov [4].

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junyi Chu, Jinjiang Li, Min Zhang. 2026-05-02. On the distribution of $αp^2$ modulo one in the intersection of two Piatetski--Shapiro sets. https://arxiv.org/abs/2312.02775

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT