Search arXivSearch

arXiv · 2008.04153

Connections between covers of $\mathbb Z$ and subset sums

Abstract

In this paper we establish connections between covers of $\mathbb Z$ by residue classes and subset sums in a field. Suppose that $A_0=\{a_s(n_s)\}_{s=0}^k$ covers each integer at least $p$ times with the residue class $a_0(n_0)=a_0+n_0\mathbb Z$ irredundant, where $p$ is a prime not dividing any of $n_1,\ldots,n_k$. Let $m_1,\ldots,m_k\in\mathbb Z$ be relatively prime to $n_1,\ldots,n_k$ respectively. For any $c,c_1,\ldots,c_k\in\mathbb Z/p\mathbb Z$ with $c_1\cdots c_k\not=0$, we show that the set $$\bigg\{\bigg\{\sum_{s\in I}\frac{m_s}{n_s}\bigg\}:\, I\subseteq\{1,\ldots,k\} \ \mbox{and}\ \sum_{s\in I}c_s=c\bigg\}$$ contains an arithmetic progression of length $n_0$ with common difference $1/n_0$, where $\{x\}$ denotes the fractional part of a real number $x$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhi-Wei Sun. 2020-08-04. Connections between covers of $\mathbb Z$ and subset sums. https://arxiv.org/abs/2008.04153

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