Related papers: Arithmetic properties of the Ramanujan function

We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…

Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Let $p(n)$ be the number of partition of a positive integer $n$. We derive a new identity for complete Bell polynomials based on a generating function of $p(7n+5)$ given by Ramanujan.

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

We study in detail the Ramanujan smooth expansions, for arithmetic functions; we start with the most general ones, for which we supply the "$P-$local expansions", for arguments with all prime-factors $p\le P$ (namely, $P-$smooth arguments),…

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

Let $\omega(n)$ (resp. $\Omega(n)$) denote the number of prime divisors (resp. with multiplicity) of a natural number $n$. In 1917, Hardy and Ramanujan proved that the normal order of $\omega(n)$ is $\log\log n$, and the same is true of…

In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $\pi(x)$, which improve the current best estimates for large values of $x$. As an…

For the unrestricted partition function $p(n)$ for integers $n \geq 0$, it is known that $p(49n + 19) \equiv 0 \pmod{49}$, $p(49n + 33) \equiv 0 \pmod{49}$, and $p(49n + 40) \equiv 0 \pmod{49}$ for all $n \geq 0$. We find witness identities…

In this paper we present a probabilistic algorithm to compute the coefficients of modular forms of level one. Focus on the Ramanujan's tau function, we give out the explicit complexity of the algorithm. From a practical viewpoint, the…

We denote $\mathcal{P}$ = $\{P(x)|$ $P(n) \mid n!$ for infinitely many $n\}$. This article identifies some polynomials that belong to $\mathcal{P}$. Additionally, we also denote $P^+(m)$ as the largest prime factor of $m$. Then, a…

A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to…

Ramanujan's celebrated partition congruences modulo $\ell\in \{5, 7, 11\}$ assert that $$ p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, $$ where $0<\delta_{\ell}<\ell$ satisfies $24\delta_{\ell}\equiv 1\pmod{\ell}.$ By proving Subbarao's…

A continued fraction $v(\tau)$ of Ramanujan is evaluated at certain arguments in the field $K = \mathbb{Q}(\sqrt{-d})$, with $-d \equiv 1$ (mod $8$), in which the ideal $(2) = \wp_2 \wp_2'$ is a product of two prime ideals. These values of…

Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a…

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

Let $P(m)$ denote the greatest prime factor of $m$. For integer $a>1$, M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, $$P(a^n-1)\gg_{\epsilon, a} n^{2-\epsilon}$$ for any $\epsilon>0$. We study analogues…