Search arXivSearch

arXiv · 2010.00126

Density of sequences of the form $x_n=f(n)^n$ in [0,1]

Abstract

In 2013, Strauch asked how various sequences of real numbers defined from trigonometric functions such as $x_n=(\cos n)^n$ distributed themselves$\pmod 1$. Strauch's inquiry is motivated by several such distribution results. For instance, Luca proved that the sequence $x_n=(\cos αn)^n\pmod 1$ is dense in $[0,1]$ for any fixed real number $α$ such that $α/π$ is irrational. Here we generalise Luca's results to other sequences of the form $x_n=f(n)^n\pmod 1$. We also examine the size of the set $|\{n\leq N:r<|\cos(nπα)|^n\}|$ where $0<r<1$ and $α$ are fixed such that $α/π$ is irrational.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J. C. Saunders. 2021-10-20. Density of sequences of the form $x_n=f(n)^n$ in [0,1]. https://arxiv.org/abs/2010.00126

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