中文
相关论文

相关论文: Arithmetic properties of the Ramanujan function

200 篇论文

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

数论 · 数学 2011-05-10 Jan-Christoph Schlage-Puchta

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

数论 · 数学 2026-04-10 Russelle Guadalupe

This paper is a tribute to the genius of the legendary Indian mathematician Srinivasa Ramanujan (22 December 1887 - 26 April 1920) in the centenary year of his death. The life story of Ramanujan is so well known that it needs no elaboration…

历史与综述 · 数学 2021-03-18 V. N. Krishnachandran

Recently Lachterman, Schayer, and Younger published an elegant proof of the Ramanujan congruences for the partition function $p(n)$. Their proof uses only the classical theory of modular forms as well as a beautiful result of Choie, Kohnen,…

数论 · 数学 2016-01-21 Oleg Lazarev , Matthew S. Mizuhara , Benjamin Reid , Holly Swisher

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

数论 · 数学 2026-04-28 Terence Tao , Joni Teräväinen

Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $\tau$ and $\mu$ denote the divisor function and the M\"{o}bius function, respectively. For an…

数论 · 数学 2021-02-09 Isao Kiuchi , Sumaia Saad Eddin

In 1918 S. Ramanujan defined a family of trigonometric sum now known as Ramanujan sums. In the last few years, Ramanujan sums have inspired the signal processing community. In this paper, we have defined an operator termed here as Ramanujan…

综合数学 · 数学 2016-11-15 Devendra Kumar Yadav , Gajraj Kuldeep , S. D. Joshi

The $A$-partition function $p_A(n)$ enumerates those partitions of $n$ whose parts belong to a fixed (finite or infinite) set $A$ of positive integers. On the other hand, the extended $A$-partition function…

组合数学 · 数学 2024-01-30 Krystian Gajdzica

For any non-negative integer $n$ and non-zero integer $r$, let $p_r(n)$ denote Ramanujan's general partition function. By employing $q$-identities, we prove some new Ramanujan-type congruences modulo 5 for $p_r(n)$ for $r=-(5\lambda+1),…

数论 · 数学 2020-08-17 Nipen Saikia , Jubaraj Chetry

For an integer $m >1$, we denote by $P(m)$ the largest prime divisor of $m$. We prove that $\limsup_{n \rightarrow +\infty} P(n!+1)/n \geqslant 1+9\log 2>7.238$, which improves a result of Stewart. More generally, for any nonzero polynomial…

数论 · 数学 2021-03-30 Li Lai

Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that…

组合数学 · 数学 2010-09-28 William Y. C. Chen , Bernard L. S. Lin

Let $\tau(n)$ be the number of divisors of $n$. We give an elementary proof of the fact that $$ \sum_{n\le x} \tau(n)^r =xC_{r} (\log x)^{2^r-1}+O(x(\log x)^{2^r-2}), $$ for any integer $r\ge 2$. Here, $$ C_{r}=\frac{1}{(2^r-1)!}…

数论 · 数学 2017-07-05 Florian Luca , László Tóth

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

数论 · 数学 2007-05-23 Ken Ono

We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where…

数论 · 数学 2023-02-06 Manjil P. Saikia , Abhishek Sarma , Pranjal Talukdar

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

综合数学 · 数学 2021-07-02 N. A. Carella

We introduce the study of \textit{randomly oriented divisor graphs}. For each $\rho \in [0,1]$, the randomly oriented divisor graph $\mathcal{D}_\rho(N)$ is obtained from the divisor graph on $\{1, 2, \ldots, N\}$ by directing each edge…

组合数学 · 数学 2026-04-08 Jihyung Kim , Tristan Phillips

Let $1=d_{1}<d_{2}< \cdots < d_{\tau(n)}=n$ denote the ordered sequence of the positive divisors of an integer $n$. We are interested in estimating the arithmetic function $$ V(n) := \prod_{1 \le i < j \le \tau(n)}(d_{j}-d_{i}) \quad (n \ge…

数论 · 数学 2025-10-07 Patrick Letendre

In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg. This class includes the famous identities by Ramanujan which provide a witness to the divisibility properties of $p(5n+4),$…

数论 · 数学 2021-12-08 Nicolas Allen Smoot

We study the shifted convolution sum of the divisor function $d_3$ and the Ramanujan $\tau$ function.

数论 · 数学 2013-04-02 Ritabrata Munshi

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

数论 · 数学 2022-10-03 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca