Salvato in:
Dettagli Bibliografici
Autore principale: Steinerberger, Stefan
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:https://arxiv.org/abs/2401.10152
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916149534392320
author Steinerberger, Stefan
author_facet Steinerberger, Stefan
contents Let $k \in \mathbb{N}$ and suppose we are given $k$ integers $1 \leq a_1, \dots, a_k \leq n$. If $\sqrt{a_1} + \dots + \sqrt{a_k}$ is not an integer, how close can it be to one? When $k=1$, the distance to the nearest integer is $\gtrsim n^{-1/2}$. Angluin-Eisenstat observed the bound $\gtrsim n^{-3/2}$ when $k=2$. We prove there is a universal $c>0$ such that, for all $k \geq 2$, there exists a $c_k > 0$ and $k$ integers in $\left\{1,2,\dots, n\right\}$ with $$ 0 <\|\sqrt{a_1} + \dots + \sqrt{a_k} \| \leq c_k\cdot n^{-c \cdot k^{1/3}},$$ where $\| \cdot \|$ denotes the distance to the nearest integer. This is a case of the square-root sum problem in numerical analysis where the usual cancellation constructions do not apply: even for $k=3$, constructing explicit examples of integers whose square root sum is nearly an integer appears to be nontrivial.
format Preprint
id arxiv_https___arxiv_org_abs_2401_10152
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sums of square roots that are close to an integer
Steinerberger, Stefan
Number Theory
Let $k \in \mathbb{N}$ and suppose we are given $k$ integers $1 \leq a_1, \dots, a_k \leq n$. If $\sqrt{a_1} + \dots + \sqrt{a_k}$ is not an integer, how close can it be to one? When $k=1$, the distance to the nearest integer is $\gtrsim n^{-1/2}$. Angluin-Eisenstat observed the bound $\gtrsim n^{-3/2}$ when $k=2$. We prove there is a universal $c>0$ such that, for all $k \geq 2$, there exists a $c_k > 0$ and $k$ integers in $\left\{1,2,\dots, n\right\}$ with $$ 0 <\|\sqrt{a_1} + \dots + \sqrt{a_k} \| \leq c_k\cdot n^{-c \cdot k^{1/3}},$$ where $\| \cdot \|$ denotes the distance to the nearest integer. This is a case of the square-root sum problem in numerical analysis where the usual cancellation constructions do not apply: even for $k=3$, constructing explicit examples of integers whose square root sum is nearly an integer appears to be nontrivial.
title Sums of square roots that are close to an integer
topic Number Theory
url https://arxiv.org/abs/2401.10152