Number of partitions of n into parts not divisible by m

2022/05/09 by Binner, Damanvir Singh
#Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2205.04527

Abstract

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

Related

• Number of partitions of n with a given parity of the smallest part
• A Refinement of the Crank-Mex Theorem
• Computation of P(n,m), the Number of Integer Partitions of n into Exactly m Parts
• Combinatorial proof of a congruence for partitions into two sizes of part
• Two Simple Ways of Generating the Partitions of (n+1) from the Partitions of n