Search arXivSearch

arXiv · 1807.08947

On the p-adic denseness of the quotient set of a polynomial image

Abstract

The quotient set, or ratio set, of a set of integers $A$ is defined as $R(A) := \left\{a/b : a,b \in A,\; b \neq 0\right\}$. We consider the case in which $A$ is the image of $\mathbb{Z}^+$ under a polynomial $f \in \mathbb{Z}[X]$, and we give some conditions under which $R(A)$ is dense in $\mathbb{Q}_p$. Then, we apply these results to determine when $R(S_m^n)$ is dense in $\mathbb{Q}_p$, where $S_m^n$ is the set of numbers of the form $x_1^n + \cdots + x_m^n$, with $x_1, \dots, x_m \geq 0$ integers. This allows us to answer a question posed in [Garcia et al., $p$-adic quotient sets, Acta Arith. 179, 163-184]. We end leaving an open question.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Piotr Miska, Nadir Murru, Carlo Sanna. 2018-07-31. On the p-adic denseness of the quotient set of a polynomial image. https://doi.org/10.1016/j.jnt.2018.08.010

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