中文
相关论文

相关论文: Distribution of sums of square roots modulo $1$

200 篇论文

We refine a remark of Steinerberger (2024), proving that for $\alpha \in \mathbb{R}$, there exists integers $1 \leq b_{1}, \ldots, b_{k} \leq n$ such that \[ \left\| \sum_{j=1}^k \sqrt{b_j} - \alpha \right\| = O(n^{-\gamma_k}), \] where…

数论 · 数学 2025-03-21 Siddharth Iyer

Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…

数论 · 数学 2026-05-27 Samuel Korsky

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…

数论 · 数学 2024-03-08 Stefan Steinerberger

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

数论 · 数学 2007-05-23 Ernie Croot

We show the existence of a constant $c > 0$ such that, for all positive integers $n$, there exist integers $1 \leq a_1 < \ldots < a_k \leq n$ such that there are at least $cn^2$ distinct integers of the form $\sum_{i=u}^{v}a_i$ with $1 \leq…

组合数学 · 数学 2023-11-17 Adrian Beker

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

计算几何 · 计算机科学 2007-05-23 Qi Cheng

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

计算几何 · 计算机科学 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

数论 · 数学 2024-12-02 Ofir Gorodetsky , Jared Duker Lichtman , Mo Dick Wong

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

数论 · 数学 2016-05-20 Sungjin Kim

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

数论 · 数学 2024-08-21 Chenhao Du , Qingfeng Sun

Let $q$ be an integer $\geq 2$ and let $S_q(n)$ denote the sum of digits of $n$ in base $q$. For \[ \alpha=[0;\overline{1,m}],\ m\geq 2, \] let $S_{\alpha}(n)$ denote the sum of digits in the Ostrowski $\alpha$-representation of $n$. Let…

数论 · 数学 2017-10-30 Divyum Sharma

By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…

数论 · 数学 2022-12-06 José L. Cereceda

Let $\mathcal{A}$ be a unital C*-algebra. Then the theory of Hilbert C*-modules tells that \begin{align*} \sum_{i=1}^{n}(a_ia_i^*)^\frac{1}{2}\leq \sqrt{n} \left(\sum_{i=1}^{n}a_ia_i^*\right)^\frac{1}{2}, \quad \forall n \in \mathbb{N},…

算子代数 · 数学 2020-10-07 K. Mahesh Krishna , P. Sam Johnson

For integers $2 \leq t \leq k$, we consider a collection of $k$ set families $\mathcal{A}_j: 1 \leq j \leq k$ where $\mathcal{A}_j = \{ A_{j,i} \subseteq [n] : 1 \leq i \leq m \}$ and $|A_{1, i_1} \cap \cdots \cap A_{k,i_k}|$ is even if and…

组合数学 · 数学 2020-11-19 Jason O'Neill , Jacques Verstraëte

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

组合数学 · 数学 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

数论 · 数学 2021-01-01 Adam J. Harper

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

数论 · 数学 2018-05-15 Paolo Leonetti , Salvatore Tringali

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

数论 · 数学 2026-05-05 Junyi Chu , Jinjiang Li , Min Zhang

Suppose that $\{a_j\}\in \ell^1$, and suppose that for any sequence $(t_n)$ of integers there exits a constant $C_1>0$ such that $$\sharp\left\{k\in\mathbb{Z}:\sup_{n\geq 1}\left|\sum_{i\in \mathcal{B}_n-t_n}…

经典分析与常微分方程 · 数学 2022-08-04 Sakin Demir

The classical theorem of Schnirelmann states that the primes are an additive basis for the integers. In this paper we consider the analogous multiplicative setting of the cyclic group $\left(\mathbb{Z}/ q\mathbb{Z}\right)^{\times}$, and…

数论 · 数学 2019-03-04 Aled Walker
‹ 上一页 1 2 3 10 下一页 ›