Ranks of partitions modulo 10 (Q740906)

In [``Some guess in the theory of partitions'', Eureka (Cambridge) 8, 10--15 (1944)] \textit{F. J. Dyson} defined the rank of an integer partition to be the largest part minus the number of the parts in the given partition. Let \(N(s,l,n)\) denote the number of partitions of \(n\) whose rank is congruent to \(s\) modulo \(l\). There are many interesting identities with respect to these numbers, like, for example \(N(1,5,5n)>N(2,5,5n)\) for any \(n\geq1\). The present paper contains the generating function of \(N(0,10,n)+N(1,10,n)-N(4,10,n)-N(5,10,n)\) and of \(N(1,10,n)+N(2,10,n)-N(3,10,n)-N(4,10,n)\). With these generating functions many inequalities similar to the above mentioned are deductible, like \(N(0,10,5n+1)>N(4,10,5n+1)\) or \(N(2,10,5n+1)>N(4,10,5n+1)\) to mention just two of them.