中文
相关论文

相关论文: Asymptotically exact heuristics for prime divisors…

200 篇论文

Let g be a non-zero rational number. Let N_{g,t}(x) denote the number of primes p<=x for which the subgroup of the multiplicative group of the finite field having p elements that is generated by g mod p is of residual index t. In Part I,…

数论 · 数学 2007-05-23 Pieter Moree

In a 1916 paper, Ramanujan studied the additive convolution $S_{a, b}(n)$ of sum-of-divisors functions $\sigma_a(n)$ and $\sigma_b(n)$, and proved an asymptotic formula for it when $a$ and $b$ are positive odd integers. He also conjectured…

数论 · 数学 2021-05-27 Robert J. Lemke Oliver , Sunrose T. Shrestha , Frank Thorne

Let $c_q(n)$ denote the Ramanujan sum modulo $q$, and let $x$ and $y$ be large reals, with $x = o(y)$. We obtain asymptotic formulas for the sums $$\sum_{n \le y}(\sum_{q \le x} c_q(n))^k \qquad (k = 1, 2).$$

数论 · 数学 2014-08-06 Tsz Ho Chan , Angel V Kumchev

For fixed integers $b\geq k$, the problem of perfect $(b,k)$-hashing asks for the asymptotic growth of largest subsets of $\{1,2,\ldots,b\}^n$ such that for any $k$ distinct elements in the set, there is a coordinate where they all differ.…

信息论 · 计算机科学 2021-01-27 Stefano Della Fiore , Simone Costa , Marco Dalai

For fixed integers $b\geq k$, a problem of relevant interest in computer science and combinatorics is that of determining the asymptotic growth, with $n$, of the largest set for which a $(b, k)$-hash family of $n$ functions exists.…

组合数学 · 数学 2022-03-23 Stefano Della Fiore , Simone Costa , Marco Dalai

In 1961, Rankin determined the asymptotic behavior of the number $S_{k,q}(x)$ of positive integers $n\le x$ for which a given prime $q$ does not divide $\sigma_k(n),$ the $k$-th divisor sum function. By computing the associated…

数论 · 数学 2025-02-07 Alexandru Ciolan , Alessandro Languasco , Pieter Moree

Let p be a prime number, and let K be a number field. For p=2, assume moreover K totally imaginary. In this note we prove the existence of asymptotically good extensions L{K of cohomological dimension 2 in which infinitely many primes split…

数论 · 数学 2020-02-26 Oussama Hamza , Christian Maire

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

数论 · 数学 2013-11-20 Salvatore Tringali

In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…

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

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

数论 · 数学 2019-08-21 Stella Brassesco , Arnaud Meyroneinc

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

数论 · 数学 2018-02-21 Xianchang Meng

Let $p\leq 23$ be a prime and $a_p(n)$ counts the number of partitions of $n$ where parts that are multiple of $p$ come up with $2$ colors. Using a result of Sussman, we derive the exact formula for $a_p(n)$ and obtain an asymptotic formula…

组合数学 · 数学 2024-11-18 Russelle Guadalupe

One of the questions of distribution of prime numbers is considered in the article. It is shown what error is obtained from the assumption that the asymptotic density of a sequence of primes is a probability. Various forms of an analogue of…

综合数学 · 数学 2020-12-17 Victor Volfson

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

数论 · 数学 2024-01-04 Cathal O'Sullivan , Jonathan P. Sorenson , Aryn Stahl

An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound…

数论 · 数学 2015-06-24 Nilotpal Kanti Sinha

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Let $I(b,d,k)$ be the subseries of the harmonic series keeping the integers having exactly $k$ occurrences of the digit $d$ in base $b$. We prove the existence of an asymptotic expansion to all orders in descending powers of $b$, for fixed…

数论 · 数学 2026-01-16 Jean-François Burnol

We derive asymptotic expansions of the Kummer functions $M(a,b,z)$ and $U(a,b+1,z)$ for large positive values of $a$ and $b$, with $z$ fixed. For both functions we consider $b/a\le 1$ and $b/a\ge 1$, with special attention for the case…

经典分析与常微分方程 · 数学 2021-02-24 Nico M. Temme

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…

数论 · 数学 2015-07-24 Jiyou Li , Daqing Wan

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

综合数学 · 数学 2017-06-20 N. A. Carella
‹ 上一页 1 2 3 10 下一页 ›