中文
相关论文

相关论文: A Moebius sum

200 篇论文

We give explicit bounds on sums of $d(n)^2$ and $d_4(n)$, where $d(n)$ is the number of divisors of $n$ and $d_4(n)$ is the number of ways of writing $n$ as a product of four numbers. In doing so we make a slight improvement on the upper…

数论 · 数学 2021-02-02 Michaela Cully-Hugill , Timothy Trudgian

Let $\Omega\subset\mathbb{R}^N$ ($N\geq 3$) be a bounded $C^2$ domain and $\Sigma\subset\partial\Omega$ be a compact $C^2$ submanifold of dimension $k$. Denote the distance from $\Sigma$ by $d_\Sigma$. In this paper, we study positive…

偏微分方程分析 · 数学 2024-06-04 Konstantinos T. Gkikas , Miltiadis Paschalis

We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.

数论 · 数学 2009-09-29 J. Brzezinski , W. Holsztynski , P. Kurlberg

We consider a multiple arithmetical sum involving the Moebius function which despite its elementary appearance is in fact of a highly intriguing nature. We establish an asymptotic formula for the quadruple case that raises the first…

数论 · 数学 2007-05-23 Yoichi Motohashi

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

数论 · 数学 2025-10-15 Andrew Pendleton

We show that the M\"obius function of an interval in a permutation poset where the lower bound is sum (resp. skew) indecomposable depends solely on the sum (resp. skew) indecomposable permutations contained in the upper bound, and that this…

组合数学 · 数学 2018-10-15 Robert Brignall , David Marchant

For each $n\ge 1$, let $X_{n,1},\ldots,X_{n,N_n}$ be real random variables and $S_n=\sum_{i=1}^{N_n}X_{n,i}$. Let $m_n\ge 1$ be an integer. Suppose $(X_{n,1},\ldots,X_{n,N_n})$ is $m_n$-dependent, $E(X_{ni})=0$, $E(X_{ni}^2)<\infty$ and…

概率论 · 数学 2022-08-15 Svante Janson , Luca Pratelli , Pietro Rigo

Let $\phi(n)$ be the Euler totient function and $\sigma(n)$ denote the sum of divisors of $n$. In this note, we obtain explicit upper bounds on the number of positive integers $n\leq x$ such that $\phi(\sigma(n)) > cn$ for any $c>0$. This…

数论 · 数学 2024-08-06 Saunak Bhattacharjee , Anup B. Dixit

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

数论 · 数学 2021-11-01 Christian Axler

This article establishes a new upper bound on the function $\sigma^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.

数论 · 数学 2015-07-02 Tim Trudgian

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$,…

数论 · 数学 2020-11-26 Olivier Bordellès

We obtain an asymptotic formula for the L^1 norm of the exponential sum $M(\alpha) = \sum_{n\le X}\tau(n)e(n\alpha)$ where $\tau(n) = \sum_{d|n} 1$ is the divisor function. In particular, we show that it is $\sim C\sqrt{X}\log X$ with $C =…

数论 · 数学 2020-05-19 Mayank Pandey

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

数论 · 数学 2009-10-05 Terence Tao

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

数论 · 数学 2016-11-16 Aleksandar Ivić

Given linear diophantine equation Ax=b, rank A=m. Let d be the maximum of absolute values of the mxm minors of the matrix (A | b). It is shown that if M={x : Ax=b, x nonnegative and integer} is nonempty, then there exists x=(x1,...,xn) in…

最优化与控制 · 数学 2008-07-01 S. I. Veselov

We study the sum $\Sigma_q(U)=\sum_{\substack{d,e\leq U\\(de,q)=1}}\frac{\mu(d)\mu(e)}{[d,e]}\log\left(\frac{U}{d}\right)\log\left(\frac{U}{e}\right)$, $U>1$, so that a continuous, monotonic and explicit version of Selberg's sieve can be…

数论 · 数学 2023-01-23 Sebastian Zuniga Alterman

Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $\theta \in (0,1)$ such that, for each $\ell>0$, there is a…

经典分析与常微分方程 · 数学 2018-05-29 Paolo Leonetti

We provide uniform bounds on mean values of multiplicative functions under very general hypotheses, detecting certain power savings missed in known results in the literature. As an application, we study the distribution of the…

数论 · 数学 2023-11-09 Akash Singha Roy

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

数论 · 数学 2021-09-22 Tomohiro Yamada

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

数论 · 数学 2010-08-09 Anirudh Prabhu