中文
相关论文

相关论文: On the divisor problem with congruence conditions

200 篇论文

The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having…

数论 · 数学 2009-10-10 László Tóth

Let $\tau_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}\tau_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log…

数论 · 数学 2015-10-22 Qingfeng Sun , Deyu Zhang

Sums of the form $\sum_{n\le x}E^k(n) (k\in{\bf N}$ fixed) are investigated, where $$ E(T) = \int_0^T|\zeta(1/2+it)|^2 dt - T\Bigl(\log {T\over2\pi} + 2\gamma -1\Bigr)$$ is the error term in the mean square formula for $|\zeta(1/2+it)|$.…

数论 · 数学 2008-11-06 Yann Bugeaud , Aleksandar Ivić

Let $\Delta_{k}(x)$ be the error term in the classical asymptotic formula for the sum $\sum_{n\leq x}d_{k}(n)$, where $d_{k}(n)$ is the number of ways $n$ can be written as a product of $k$ factors. We study the analytic properties of the…

数论 · 数学 2024-12-17 T. Makoto Minamide , Yoshio Tanigawa , Nigel Watt

In this paper we define a new operator $J$ for the study of $$ \Delta u +f(u)=0,\quad x\in R ^N, N> 2. $$ Using $J$ we can easily see some qualitative properties of the solutions, for example we can determine how many times $u$ changes…

偏微分方程分析 · 数学 2023-12-29 Pilar Herreros

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

数论 · 数学 2016-11-24 Lirui Jia , Wenguang Zhai

In this note, we solve some sign change problems on the functions involving sums of divisors posed by Pongsriiam recently.

数论 · 数学 2024-01-19 Yuchen Ding , Hao Pan , Yu--Chen Sun

We study the problem of estimating the number of defective items $d$ within a pile of $n$ elements up to a multiplicative factor of $\Delta>1$, using deterministic group testing algorithms. We bring lower and upper bounds on the number of…

信息论 · 计算机科学 2020-09-08 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

The principal aim of this note is to illustrate how factorizations of singular, even-order partial differential operators yield an elementary approach to classical inequalities of Hardy-Rellich-type. More precisly, introducing the…

偏微分方程分析 · 数学 2017-04-18 Fritz Gesztesy , Lance Littlejohn

Let $\tau(n)$ denote the classical divisor function. In this paper, we consider the hyperbolic fractional sum of the divisor function defined by $$ T(x) = \sum_{n_1 n_2 \leqslant x} \tau\left( \left[ \frac{x}{n_1 n_2} \right] \right) =…

数论 · 数学 2026-04-23 Ling Li

An initial-boundary value problem of subdiffusion type is considered; the temporal component of the differential operator has the form $\sum_{i=1}^{\ell}q_i(t)\, D _t ^{\alpha_i} u(x,t)$, where the $q_i$ are continuous functions, each $D _t…

数值分析 · 数学 2022-06-24 Natalia Kopteva , Martin Stynes

Regularity properties of solutions to variational problems are established for a broad class of strictly convex splitting-type energy densities of the principal form $f$: $\mathbb{R}^2 \to \mathbb{R}$, \[ f(\xi_1,\xi_2) = f_1\big( \xi_1…

偏微分方程分析 · 数学 2020-08-13 Michael Bildhauer , Martin Fuchs

Asymptotic formulae for Titchmarsh-type divisor sums are obtained with strong error terms that are uniform in the shift parameter. This applies to more general arithmetic functions such as sums of two squares, improving the error term in…

数论 · 数学 2020-05-29 Edgar Assing , Valentin Blomer , Junxian Li

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

数论 · 数学 2026-03-10 George E. Andrews , Mohamed El Bachraoui

We investigate the properties of the moments of the cot function using the central factorial numbers. Using a new integral representation of the central factorial numbers, we find a new way to express these moments in terms of recursive…

数论 · 数学 2024-10-03 Serge Iovleff

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

数论 · 数学 2020-11-25 James Maynard

We show that there exist constants $\delta_1,\delta_2>0$ such that if $G$ is an $(n,d,\lambda)$-graph with $\lambda/d\le\delta_1$, then $G$ contains an induced cycle of length at least $\delta_2n/d$. We further demonstrate that, up to a…

组合数学 · 数学 2025-05-30 Sahar Diskin , Michael Krivelevich , Itay Markbreit , Maksim Zhukovskii

We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums…

数论 · 数学 2024-01-26 Marco Aymone

N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can…

数论 · 数学 2015-10-21 Andrew V. Lelechenko

We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$ up to factors of size $e^{O(q^2)}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, for all real $1 \leq q \leq \frac{c\log x}{\log\log…

数论 · 数学 2020-01-08 Adam J. Harper