English
Related papers

Related papers: On the binary digits of $\sqrt{2}$

200 papers

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

Combinatorics · Mathematics 2022-05-24 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

Number Theory · Mathematics 2024-04-02 Siddharth Iyer

Spanner constructions focus on the initial design of the network. However, networks tend to improve over time. In this paper, we focus on the improvement step. Given a graph and a budget $k$, which $k$ edges do we add to the graph to…

Computational Geometry · Computer Science 2024-07-08 Kevin Buchin , Maike Buchin , Joachim Gudmundsson , Sampson Wong

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…

Number Theory · Mathematics 2008-08-20 Vladimir Shevelev

In this paper, we consider the problem of constructing optimal average-length binary codes under the constraint that each codeword must contain at most $D$ ones, where $D$ is a given input parameter. We provide an $O(n^2D)$-time complexity…

Information Theory · Computer Science 2025-12-03 Roberto Bruno , Roberto De Prisco , Ugo Vaccaro

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

Number Theory · Mathematics 2016-08-16 David Applegate , Benoit Cloitre , Philippe Deléham , N. J. A. Sloane

We show that univariate trinomials $x^n + ax^s + b \in \mathbb{F}_q[x]$ can have at most $\delta \Big\lfloor \frac{1}{2} +\sqrt{\frac{q-1}{\delta}} \Big\rfloor$ distinct roots in $\mathbb{F}_q$, where $\delta = \gcd(n, s, q - 1)$. We also…

Number Theory · Mathematics 2016-12-09 Zander Kelley , Sean Owen

Let $S_n=\e_1+...+\e_n$, where $ \e_i $ are i.i.d. Bernoulli r.v.'s. Let $0\le r_d(n)<2d$ be the least residue of $n$ mod$(2d)$, $\bar r_d(n)= 2d -r_d(n)$ and $\b(n,d)=\max ({1\over d}, {1\over \sqrt n})[e^{- {r_d(n)^2/2 n}} +e^{- {\bar…

Number Theory · Mathematics 2009-08-17 Michel Weber

We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…

Number Theory · Mathematics 2007-05-23 Jordan S. Ellenberg , Akshay Venkatesh

We use bounds of character sums and some combinatorial arguments to show the abundance of very smooth numbers which also have very few non-zero binary digits.

Number Theory · Mathematics 2023-06-13 Maximilian Hauck , Igor E. Shparlinski

For positive integers $n$, the truncated binomial expansions of $(1+x)^n$ which consist of all the terms of degree $\le r$ where $1 \le r \le n-2$ appear always to be irreducible. For fixed $r$ and $n$ sufficiently large, this is known to…

Number Theory · Mathematics 2018-03-08 Michael Filaseta , Richard Moy

For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…

Number Theory · Mathematics 2021-01-28 Asaf Cohen Antonir , Asaf Shapira

We shall investigate and arrive at a certain functional property of the double series \[ \sum\limits_{n,r\geq 1}\frac{1}{\sqrt{x^2n^2+r^2+w^2}\left( e^{2 \pi y\sqrt{x^2n^2+r^2+w^2}}-1\right)}. \]

Combinatorics · Mathematics 2025-11-18 Aung Phone Maw

Let $\mathsf{s}(n)$ denote the sum of binary digits of an integer $n \geq 0$. In the recent years there has been interest in the behavior of the differences $\mathsf{s}(n+t)-\mathsf{s}(n)$, where $t \geq 0$ is an integer. In particular,…

Number Theory · Mathematics 2024-12-23 Bartosz Sobolewski

A set $S$ of natural numbers is multiplicative Sidon if the products of all pairs in $S$ are distinct. Erd\H{o}s in 1938 studied the maximum size of a multiplicative Sidon subset of $\{1,\ldots, n\}$, which was later determined up to the…

Number Theory · Mathematics 2018-08-21 Hong Liu , Péter Pál Pach

Suppose that $ m\equiv 1\mod 4 $ is a prime and that $ n\equiv 3\mod 4 $ is a primitive root modulo $ m $. In this paper we obtain a relation between the class number of the imaginary quadratic field $ \Q(\sqrt{-nm}) $ and the digits of the…

Number Theory · Mathematics 2024-02-16 Kalyan Chakraborty , Krishnarjun Krishnamoorthy

Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…

Combinatorics · Mathematics 2014-03-18 Kai-Uwe Schmidt

For a given quadratic irrational $\alpha$, let us denote by $D(\alpha)$ the length of the periodic part of the continued fraction expansion of $\alpha$. We prove that for a positive integer $d$, which is not a perfect square, the sequence…

Number Theory · Mathematics 2021-06-08 Filip Gawron , Tomasz Kobos