Search arXivSearch

arXiv · 0904.2101

Several results on sequences which are similar to the positive integers

Abstract

Sequence of positive integers $\{x_n\}_{n\geq1}$ is called similar to $\mathbb {N}$ respectively a given property $A$ if for every $n\geq1$ the numbers $x_n$ and $n$ are in the same class of equivalence respectively $A\enskip(x_n\sim n (prop \enskip A).$ If $x_1=a(>1)\sim1 (prop\enskip A)$ and $x_n>x_{n-1}$ with the condition that $x_n$ is the nearest to $x_{n-1}$ number such that $x_n\sim n (prop \enskip A),$ then the sequence $\{x_n\}$ is called minimal recursive with the first term $a\enskip(\{x_n^{(a)}\}).$ We study two cases: $A=A_1$ is the value of exponent of the highest power of 2 dividing an integer and $A=A_2$ is the parity of the number of ones in the binary expansion of an integer. In the first case we prove that, for sufficiently large $n, \enskip x_n^{(a)}=x_n^{(3)};$ in the second case we prove that, for $a>4$ and sufficiently large $n,\enskip x_n^{(a)}=x_n^{(4)}.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vladimir Shevelev. 2009-04-20. Several results on sequences which are similar to the positive integers. https://arxiv.org/abs/0904.2101

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