International Research Journal of Mathematics, Engineering and IT

Vol. 3, Issue 12, December 2016 Impact Factor- 5.489

ISSN: (2349-0322)
© Associated Asia Research Foundation (AARF)
Website: www.aarf.asia Email : editor@aarf.asia , editoraarf@gmail.com

A NOTE ON M1 PARTITIONS OF n
Dr. K. Hanumareddy Gudimella V R K Sagar
Department of Mathematics L/Mathematics
Hindu College Govt.Polytechnic
Acharya Nagarjuna University Ponnur
Guntur, India. Guntur, India.

ABSTRACT
S.Ahlgren, Bringmann and Lovejoy [1] defined M 2spt  n  to be the number of
smallest parts in the partitions of n without repeated odd parts and with smallest part even
and Bringmann, Lovejoy and Osburn [4]derived the generating function for M 2spt  n  .
Hanumareddy and Manjusri [5] derived generating function for the number of smallest parts
of partitions of n by using r  partitions of n. In this chapter we defined M 1spt  n  as the
number of smallest parts in the partitions of n without repeated even parts and with smallest
part odd and also derive its generating function by using r  M 1 partitions of n . We also
derive generating function for M 1spt  n  .
Keywords: Partition, r-partition, M1Partition, Smallest part of the M1Partition.
Subject classification: 11P81 Elementary theory of Partitions.
1. Introduction:
Let M 1  n  be denote the set of all M 1 partitions of n with even numbers not

repeated and smallest parts are odd numbers. Let M 1 p  n  be the cardinality of M 1  n  ,

write M 1 pr  n  for the number of r  M 1 partitions of n in M 1  n  each consisting of

exactly r parts, i.e r  M 1 partitions of n in M 1  n  . Let M 1 p  k , n  represent the number of

M 1 partitions of n in M 1  n  using natural numbers at least as large as k only. Let the

partitions in M 1  n  be denoted by M 1 partitions.

Let M 1spt  n  be denotes the number of smallest parts including repetitions in all

partitions of n in M 1  n  and sumM 1spt  n  be denotes the sum of the smallest parts.

A Monthly Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories.
International Research Journal of Mathematics, Engineering and IT (IRJMEIT)
48 | P a g e
M 1ms     number of smallest parts of  in M 1  n  .

M 1spt  n  = 
  n 
M 1ms   

M 1  n  be denote set of all M 1 partitions of n.

For example M 1  7  : M 1 p  7   11 M 1spt  7   28

7, 6  1, 4  3, 5  1  1 , 4  2  1, 3  3  1, 4  1  1  1 , 3  2  1  1, 3  1  1  1  1 , :
2  1  1  1  1  1, 1  1  1  1  1  1  1.

We observe that

1.1. The generating function for the number of r  partitions of n with even numbers not
repeated is

q r   q, q 2 
M pr  n  
1 r

 q2 , q2  r

1.2. The generating function for the number of r  M 1 partitions of n with even numbers
appears at most one time and smallest parts are odd numbers is

q r   q, q 2 
M 1 pr  n   r 1
(1.1)
q , q 
2 2
r

2. Generating function for M 1spt  n 

The generating function for the number of smallest parts of all partitions of positive

integer n is derived by G.E. Andrews. By utilizing r  M 1 partitions of n, we propose a

formula for finding the number of smallest parts of n.

2.1 Theorem:
 
1 if 2k  1| n
M 1spt  n    M 1 p  2k  1, n   2k  1 t    where   
k 1 t 1 0 otherwise

A Monthly Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories.
International Research Journal of Mathematics, Engineering and IT (IRJMEIT)
49 | P a g e
Proof: Let n  (1 , 2 , ... , r ) =  11 , 22 ,..., l 1l1 , k1l  ,

 1
1 
, 22 ,..., l 1l1 , k1l  M 1  n  , k1  2k  1, k  N be any r  M 1 partition of n with l

distinct parts such that even parts not repeated and smallest parts are odd numbers
Case 1: Let r   l  t which implies r t  k1 . Subtract all k1 ' s , we get

  
n  tk1  11 , 22 ,..., l 1l1 , 11 , 22 ,..., l 1l1  M 1  n 


Hence n  tk1  11 , 22 ,..., l 1l1  is a  r  t   M 1 partition of n  tk1 with l - 1

distinct parts and each part is greater than or equal to k1  1 . Here we get the number of

r  M 1 partitions with smallest part k1 that occurs exactly t times among all

r  M 1 partitions of n is M 1 pr t  k1  1, n  tk1  .

Case 2: Let r   l  t which implies r t  k1

Omit k1 ' s from last t places, we get  

n  tk1  11 , 22 ,..., l 1l1 , k1l t ,

 1
1 
, 22 ,..., l 1l1 , k1l t  M 1  n  . Hence  
n  tk1  11 , 22 ,..., l 1l1 , k1l t is a

 r  t   M 1 partition of n  tk1 with l distinct parts and the least part is k1 .

Now we get the number of r  M 1 partitions with smallest part k1 that occurs more

than t times among all r  M 1 partitions of n is M 1 f r t  k1 , n  tk1 

Case 3: Let r   l  t which implies all parts in the partition are equal which are odd.

The number of partitions of n with equal parts in set M 1  n  , k1  2 N  1 is equal to the

number of divisors of 2n 1. Since the number of divisors of 2n 1 is d  2n  1 , the number

of partitions of n with equal parts in set M 1  n  , k1  2 N  1 is

1 if k1 | n
d  2n  1 where   
0 otherwise

From cases (1), (2) and (3) we get r  M 1 partitions of n with smallest part k1 that
occurs t times is

M 1 f r t  k1 , n  tk1   M 1 pr t  k1  1, n  tk1   

1 if k1 | n
 M 1 pr t  k1 , n  tk1    where   
0 otherwise

The number of smallest parts in M 1 partitions of n is

A Monthly Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories.
International Research Journal of Mathematics, Engineering and IT (IRJMEIT)
50 | P a g e
  
1 if k1 | n
M 1spt  n    M 1 p  k1 , n  tk1    where   
k1 1 t 1 0 otherwise
 
1 if 2k  1| n
 M 1spt  n    M 1 p  2k  1, n   2k  1 t    where   
k 1 t 1 0 otherwise

2.2. Theorem: M 1 pr  2k  1, n   M 1 pr  n  2kr 

Proof: Let n  (1 , 2 , ... , r ), i  2k i , be any r  M 1 partition of n such that even

numbers not repeated and smallest parts are odd numbers. Subtracting 2k from each part, we

get n  2kr   1  2k , 2  2k ,..., r  2k 

Hence n  2kr   1  2k , 2  2k ,..., r  2k  is a r  M 1 partition of n  2kr with even parts

not repeated and smallest parts are odd.

Therefore the number of r  M 1 partitions of n with parts greater than or equal to 2k 1 is

M 1 pr  n  2kr  .

Hence M pr  2k  1, n   M pr  n  2kr  .
1 1

  q 2 n1  q 2 n ; q 2 
2.3. Theorem:  M 1spt  n  q   n 

n 1 n 1 1  q   q
2 n 1 2 2 n 1
; q2 


Proof: From theorem (2.1) we have

 
M 1spt  n    M 1 p  2k  1, n   2k  1 t   
k 1 t 1

first replace 2k  1 by 2k  1, then replace n by n   2k  1 t in theorem  2.2.

  
  M 1 pr  n   2k  1 t  r  2k  2   
t 1 r 1 n 1

1 if 2k  1| n
where   
0 otherwise

   q r  2 k 1t  r  2 k 2  q, q 2  

q 2 k 1
  r

k 1 t 1 r 1 q , q  2 2
r
k 1 1  q
2 k 1

   q 2 k 1t  r  2 k 1  q, q 2  

q 2 k 1
  r

k 1 t 1 r 1 q , q 
2 2
r
k 1 1  q
2 k 1

   q 2 k 1 r  q, q 2   
 
q 2 k 1
  q 
 
 2 k 1t r 

k 1 t 1  r 1

 q2 , q2 
r 
k 1 1  q
2 k 1

A Monthly Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories.
International Research Journal of Mathematics, Engineering and IT (IRJMEIT)
51 | P a g e
 q 2 k 1    q   q, q r   q 2 k 1
  2 k 1 r 2 
 2 k 1 
 

k 1 1  q  r 1

 q2 , q2 
r 
k 1 1  q
2 k 1

  q    q, q 2  
2 k 1 r

q 2 k 1 
 1  r 

k 1 1  q 2 k 1


r 1  q 2
, q 2
r 
Put t  q 2 k 1 , a  q, q  q 2 in theorem 2.1 'The Theory of partitions'by G.E.Andrews



q 2 k 1 
1  q 2 r  2 k 11 
2 k 1 
k 1 1  q  r 0 1  q 2r 2k 1 


q 2 k 1 
1  q2r 2k 
2 k 1 
k 1 1  q  r 0 1  q2r 2k 1 
 q 2 k 1 1  q 2 k 1  q 2 k  2 1  q 2 k  4 1  q 2 k 6  ...

k 1 1  q 1  q 1  q 1  q 1  q  ...
2 k 1 2 k 1 2 k 1 2 k 3 2 k 5

 q 2 k 1  q 2 k ; q 2 
 

k 1 1  q   q
2 k 1 2 2 k 1
; q2 


  q 2 n1  q 2 n ; q 2 
 M 1spt  n  q   n 

n 1 n 1 1  q   q
2 n 1 2 2 n 1
; q2 


 
2.4 .Corollary: c1M 1spt  n    M 1 p  c1  2k  1 , n  c1  2k  1 t   1
k 1 t 1

1 if c1  2k  1 | n
where 1   and c1  2c  1, c  N
0 otherwise

2.5. Theorem: M 1 pr  2c1k  1, n   M 1 pr  n  2c1kr  where c1  2c  1, c  N

Proof: Let n  (1 , 2 , ... , r ), i  2c1k i , be any r  M 1 partition of n such that even

numbers not repeated and smallest parts are odd numbers and c is a constant. Subtracting

2c1k from each part, we get n  2c1kr   1  2c1k , 2  2c1k ,..., r  2c1k 

Hence n  2c1kr   1  2c1k , 2  2c1k ,..., r  2c1k  is a r  M 1 partition of n  2c1kr with even

parts not repeated and smallest parts are odd.

Therefore the number of r  M 1 partitions of n with parts greater than or equal to 2c1k  1 is

M 1 pr  n  2c1kr .

A Monthly Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories.
International Research Journal of Mathematics, Engineering and IT (IRJMEIT)
52 | P a g e
Hence M pr  2c1k  1, n   M pr  n  2c1kr  where c1  2c  1, c  N
1 1

2.6.Theorem:

  
q c1  2 n 1 q c1  2 n 1 1; q 2 
 c M 1spt  n  q   n 
where c1  2c  1
  
1 2
c1  2 n 1 c1  2 n 1  2
n 1 n 1 1 q q ; q2


   2n  1 q 2n1  q 2n ; q 2 
2.7. Theorem:  sumM 1spt  n  q n  
n 1 n 1 1  q   q 2 n 1 2 2 n 1
; q2 


3.References:
1 S.Ahlgren,K.Bringmann,J.Lovejoy. l  adic properties of smallest parts functions.
Adv.Math., 228(1) : 629  645, 2011.

 2 G.E.Andrews,The theory of partitions.

3 G.E.Andrews, The number of smallest parts in the partitions of n .

J.Reine Angew.Math ., 624 :133  142, 2008.

 4 K.Bringmann,J.Lovejoy and R.Osburn.Automorphic properties of generating

functions for generalized rank moments and Durfee symbols.
Int.Math.Res.Not.IMRN, (2) : 238  260, 2010.

5 K.Hanumareddy,A.Manjusri The number of smallest parts of Partition of n.

IJITE.,Vol.03,Issue-03,(March2015) ,ISSN:2321  1776.

A Monthly Double-Blind Peer Reviewed Refereed Open Access International e-Journal - Included in the International Serial Directories.
International Research Journal of Mathematics, Engineering and IT (IRJMEIT)
53 | P a g e