Search arXivSearch

arXiv · 1711.00172

On $AP_3$ - covering sequences

Abstract

Recently, motivated by Stanley sequences, Kiss, S\' andor and Yang introduced a new type sequence: a sequence $A$ of nonnegative integers is called an $AP_k$ - covering sequence if there exists an integer $n_0$ such that if $n > n_0$, then there exist $a_1\in A, \dots , a_{k-1}\in A$, $a_1<a_2<\cdots <a_{k-1}<n$ such that $a_1, \dots , a_{k-1}, n$ form a $k$-term arithmetic progression. They prove that there exists an $AP_3$ - covering sequence $A$ such that $\limsup\limits_{n\to\infty}{A(n)}/{\sqrt n}\le 34$. In this note, we prove that there exists an $AP_3$ - covering sequence $A$ such that $\limsup\limits_{n\to\infty}{A(n)}/{\sqrt n}=\sqrt{15}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yong-Gao Chen. 2017-11-01. On $AP_3$ - covering sequences. https://doi.org/10.1016/j.crma.2017.12.013

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