English
Related papers

Related papers: Odd values of the Ramanujan tau function

200 papers

We continue our study of a basic but seemingly intractable problem in integer partition theory, namely the conjecture that $p(n)$ is odd exactly $50\%$ of the time. Here, we greatly extend on our previous paper by providing a…

Combinatorics · Mathematics 2018-03-28 Samuel D. Judge , Fabrizio Zanello

Recently, Amdeberhan and Merca proved some arithmetic properties of the crank parity function $C(n)$ defined as the difference between the number of partitions of $n$ with even cranks and those with odd cranks and the sequence $a(n)$ whose…

Number Theory · Mathematics 2025-09-23 Russelle Guadalupe

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…

Number Theory · Mathematics 2025-02-07 Alexandru Ciolan , Alessandro Languasco , Pieter Moree

In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from…

Number Theory · Mathematics 2015-03-16 Miki Hirano , Kohei Katata , Yoshinori Yamasaki

We prove that there are infinitely many solutions of $$ |\lambda_0+\lambda_1p+\lambda_2P_r|<p^{-\tau}, $$ where $r=3,$ $\tau=\frac1{118}$, and $\lambda_0$ is an arbitrary real number and $\lambda_1,\lambda_2\in\BR$ with $\lambda_2\neq0$ and…

Number Theory · Mathematics 2016-05-24 Liyang Yang

We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.

Number Theory · Mathematics 2020-12-29 Tomohiro Yamada

This paper provides a survey of particular values of Ramanujan's theta function $\varphi(q)=\sum_{n=-\infty}^{\infty}q^{n^2}$, when $q=e^{-\pi\sqrt{n}}$, where $n$ is a positive rational number. First, descriptions of the tools used to…

Number Theory · Mathematics 2022-12-23 Bruce C. Berndt , Örs Rebák

Ramanujan famously found congruences for the partition function like p(5n+4) = 0 modulo 5. We provide a method to find all simple congruences of this type in the coefficients of the inverse of a modular form on Gamma_{1}(4) which is…

Number Theory · Mathematics 2019-08-15 Michael Dewar

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

Number Theory · Mathematics 2010-12-22 Zhi-Wei Sun

Let $\mathcal{A}$ be a unital $C^\ast$-algebra equipped with a faithful tracial positive linear functional $\tau$. Denote by $\mathcal{A}_+$ its positive cone. For $p>0$ and $A,B\in\mathcal{A}_+$, we consider the operations $$ A\kappa_p B…

Operator Algebras · Mathematics 2026-02-13 Teng Zhang

We present an infinite family of identities that represent Ramanujan's tau function in terms of convolution sums of twisted divisor functions. Our method involves explicitly constructing non-vanishing level $1$ cusp forms from modular forms…

Number Theory · Mathematics 2026-04-16 Tianyu Ni

We prove a remarkable formula of Ramanujan for the logarithmic derivative of the gamma function, which converges more rapidly than classical expansions, and which is stated without proof in Ramanujan's notebooks. The formula has a number of…

Classical Analysis and ODEs · Mathematics 2007-06-13 David M. Bradley

We introduce a fast algorithm to compute the Ramanujan-Deninger gamma function and its logarithmic derivative at positive values. Such an algorithm allows us to greatly extend the numerical investigations about the Euler-Kronecker constants…

Number Theory · Mathematics 2021-09-01 Alessandro Languasco , Luca Righi

In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical…

Number Theory · Mathematics 2025-05-27 Tewodros Amdeberhan , Mircea Merca

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…

Combinatorics · Mathematics 2019-02-22 Frank Garvan , Michael J. Schlosser

Fundamental mathematical constants like $e$ and $\pi$ are ubiquitous in diverse fields of science, from abstract mathematics to physics, biology and chemistry. For centuries, new formulas relating fundamental constants have been scarce and…

Machine Learning · Computer Science 2021-04-29 Gal Raayoni , Shahar Gottlieb , George Pisha , Yoav Harris , Yahel Manor , Uri Mendlovic , Doron Haviv , Yaron Hadad , Ido Kaminer

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),…

Number Theory · Mathematics 2020-08-17 Nipen Saikia , Jubaraj Chetry

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Combinatorics · Mathematics 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello

A representation of divisor function $\tau(n)\equiv \sigma_{0}(n)$ by means of logarithmic residue of a function of complex variable is suggested. This representation may be useful theoretical instrument for further investigations of…

Number Theory · Mathematics 2011-09-19 E. E. Kholupenko

Let $\Bbb Z$ and $\Bbb Z^+$ be the set of integers and the set of positive integers, respectively. For $a,b,c,d,n\in\Bbb Z^+$ let $t(a,b,c,d;n)$ be the number of representations of $n$ by $ax(x+1)/2+by(y+1)/2+cz(z+1)/2+dw(w+1)/2$…

Number Theory · Mathematics 2019-10-29 Zhi-Hong Sun