中文
相关论文

相关论文: Integers with a large smooth divisor

200 篇论文

The main aim of this paper is to study an analogue of the generalized divisor function in a number field $\mathbb{K}$, namely, $\sigma_{\mathbb{K},\alpha}(n)$. The Dirichlet series associated to this function is…

数论 · 数学 2021-06-10 Rajat Gupta , Sudip Pandit

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

We investigate properties of zeta functions of polynomial rings and their quotients, generalizing and extending some classical results about Dedekind zeta functions of number fields. By an application of Delange's version of the Ikehara…

数论 · 数学 2017-01-18 Lenny Fukshansky , Stefan Kühnlein , Rebecca Schwerdt

Making use of covering systems and a theorem of D. Shiu, the first and second authors showed that for every positive integer $k$, there exist $k$ consecutive widely digitally delicate primes. They also noted that for every positive integer…

数论 · 数学 2022-09-23 Michael Filaseta , Jacob Juillerat , Thomas Luckner

The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…

数论 · 数学 2021-10-11 Romulo L. Cruz-Simbron

Let $n$ be a positive integer and $\alpha_n$ be the arithmetic function which assigns the multiplicative order of $a^n$ modulo $n$ to every integer $a$ coprime to $n$ and vanishes elsewhere. Similarly, let $\beta_n$ assign the projective…

数论 · 数学 2016-03-24 Jonathan Chappelon

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

数论 · 数学 2026-02-16 Meselem Karras

We survey arithmetic and asymptotic properties of the alternating sum-of-divisors function $\beta$ defined by $\beta(p^a)=p^a-p^{a-1}+p^{a-2}-...+(-1)^a$ for every prime power $p^a$ ($a\ge 1$), and extended by multiplicativity. Certain open…

数论 · 数学 2014-01-28 László Tóth

Let $b$ be a positive integer greater than 1, $N$ a positive integer relatively prime to $b$, $ |b|_{N}$ the order of $b$ in the multiplicative group $% \mathbb{U}_{N}$ of positive integers less than $N$ and relatively primes to $% N,$ and…

Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if…

数论 · 数学 2016-03-02 Quanli Shen

We study an asymptotic behavior of the sum $\sum\limits_{n\le x}\frac{\D \tau(n)}{\D \tau(n+a)}$. Here $\tau(n)$ denotes the number of divisors of $n$ and $a\ge 1$ is a fixed integer.

数论 · 数学 2013-02-04 M. A. Korolev

Celebrated theorems of Roth and of Matou\v{s}ek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta(n^{1/4})$. We study the analogous problem in the $\mathbb{Z}_n$ setting.…

组合数学 · 数学 2024-04-04 Jacob Fox , Max Wenqiang Xu , Yunkun Zhou

Let $x$ be a positive real number, and $\mathcal{P} \subset [2,\lambda(x)]$ be a set of primes, where $\lambda(x) \in \Omega(x^\varepsilon)$ is a monotone increasing function with $\varepsilon \in (0,1)$. We examine $Q_{\mathcal{P}}(x)$,…

数论 · 数学 2023-08-29 G. Roman

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

数论 · 数学 2024-05-01 Mircea Cimpoeas

In this paper one constructs a function $\eta$ with the property that if $n$ is non-null then $\eta(n)$ is the smallest integer such that $\eta(n)!$ is divisible by $n$. In order to calculate it one considers, for each prime $p$, the…

综合数学 · 数学 2007-05-23 Florentin Smarandache

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

数论 · 数学 2017-07-31 Angel Kumchev , Huafeng Liu

We show that if a,b,c,d,f are positive integers such that a+b+c+d+f is even, then the Witten zeta value zeta_{sl(4)}(a,b,c,d,0,f) is expressible in terms of Witten zeta functions with fewer arguments.

数论 · 数学 2012-05-07 David M. Bradley , Tianxin Cai , Xia Zhou

The bivariate series $\theta (q,x):=\sum _{j=0}^{\infty}q^{j(j+1)/2}x^j$ %(where $(q,x)\in {\bf C}^2$, $|q|<1$) defines a {\em partial theta function}. For fixed $q$ ($|q|<1$), $\theta (q,.)$ is an entire function. For $q\in (-1,0)$ the…

经典分析与常微分方程 · 数学 2019-05-10 Vladimir Petrov Kostov

Let $\taue_k \colon \Z\to\Z$ be a multiplicative function such that $ \taue_k(p^a) = \sum_{d_1... d_k=a} 1 $. In the present paper we introduce generalizations of $\taue_k$ over the ring of Gaussian integers $\Zi$. We determine their…

数论 · 数学 2012-11-06 Andrew V. Lelechenko

The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…

数论 · 数学 2013-08-06 Eric Bach , Andrew Shallue
‹ 上一页 1 8 9 10 下一页 ›