English
Related papers

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

200 papers

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

Combinatorics · Mathematics 2016-10-26 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

Let $f(n)$ be a Steinhaus random multiplicative function. Let $A\subset [1, N]$ be a finite set of integers. We show that \[\frac{1}{\sqrt{|A|}} \sum_{n\in A} f(n) \xrightarrow[]{d} \mathcal{CN}(0,1)\] forces that $|A|=o(N)$. We prove that…

Number Theory · Mathematics 2026-05-26 Max Wenqiang Xu

Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.

Number Theory · Mathematics 2025-05-15 Chunlei Liu

Let $g$ be sufficiently large, $b\in\{0,\ldots,g-1\}$, and $\mathcal{S}_b$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every sufficiently large odd integer $N$ can be written as $p_1 + p_2 +…

Number Theory · Mathematics 2025-01-03 James Leng , Mehtaab Sawhney

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

Number Theory · Mathematics 2019-08-14 Christian Elsholtz , Christopher Frei

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

Information Theory · Computer Science 2024-04-30 Tingting Wu , Lanqiang Li , Xiuyu Zhang , Shixin Zhu

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

Number Theory · Mathematics 2009-06-16 Shaofang Hong , Scott D. Kominers

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

Number Theory · Mathematics 2026-02-04 Stephan Baier , Habibur Rahaman

In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…

Genomics · Quantitative Biology 2011-01-19 Cynthia Vinzant

Inspired by a question asked on the list {\tt mathfun}, we revisit {\em Kempner-like series}, i.e., harmonic sums $\sum' 1/n$ where the integers $n$ in the summation have ``restricted'' digits. First we give a short proof that $\lim_{k \to…

Number Theory · Mathematics 2024-03-25 Jean-Paul Allouche , Claude Morin

We obtain some new upper bounds on the maximum number $f(n)$ of edges in $n$-vertex graphs without containing cycles of length four. This leads to an asymptotically optimal bound on $f(n)$ for a broad range of integers $n$ as well as a…

Combinatorics · Mathematics 2021-10-13 Jie Ma , Tianchi Yang

we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse

We improve a result of H. L. Montgomery and J. P. Weinberger by establishing the existence of infinitely many fundamental discriminants $d>0$ for which the class number of the real quadratic field $\mathbb{Q}(\sqrt{d})$ exeeds…

Number Theory · Mathematics 2015-02-09 Youness Lamzouri

We show that the number of integer solutions for a pair of bilinear equations in at least 2*6 variables has (up to logarithms) the expected upper bound unless there is a structural reason why it is not the case.

Number Theory · Mathematics 2014-12-12 Eugen Keil

We show that for all real biquadratic fields not containing $\sqrt{2}$, $\sqrt{3}$, $\sqrt{5}$, $\sqrt{6}$, $\sqrt{7},$ and $\sqrt{13}$, the Pythagoras number of the ring of algebraic integers is at least $6$. We will also provide an upper…

Number Theory · Mathematics 2023-11-29 Magdaléna Tinková

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu

For all $\alpha_1,\alpha_2\in(1,2)$ with $1/\alpha_1+1/\alpha_2>5/3$, we show that the number of pairs $(n_1,n_2)$ of positive integers with $N=\lfloor{n_1^{\alpha_1}}\rfloor+\lfloor{n_2^{\alpha_2}}\rfloor$ is equal to…

Number Theory · Mathematics 2024-07-30 Yuuya Yoshida

Let $k$ be a number field. We provide an asymptotic formula for the number of Galois extensions of $k$ with absolute discriminant bounded by some $X \geq 1$, as $X\to\infty$. We also provide an asymptotic formula for the closely related…

Number Theory · Mathematics 2024-06-07 Robert J. Lemke Oliver

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

Number Theory · Mathematics 2023-09-04 Vítězslav Kala , Piotr Miska

Understanding the distribution of digits in the expansions of perfect powers in different bases is difficult. Rather than consider the asymptotic digit distributions, we consider the base-10 digits of a restricted sequence of powers of two.…

Number Theory · Mathematics 2019-06-04 David Wu
‹ Prev 1 3 4 5 6 7 10 Next ›