{"title":"Some Congruences for Andrews’ Partition Function EO(n)","authors":"S. N. Fathima, U. Pore","doi":"10.5666/KMJ.2021.61.1.49","DOIUrl":null,"url":null,"abstract":"Abstract. Recently, Andrews introduced partition functions EO(n) and EO(n) where the function EO(n) denotes the number of partitions of n in which every even part is less than each odd part and the function EO(n) denotes the number of partitions enumerated by EO(n) in which only the largest even part appears an odd number of times. In this paper we obtain some congruences modulo 2, 4, 10 and 20 for the partition function EO(n). We give a simple proof of the first Ramanujan-type congruences EO (10n+ 8) ≡ 0 (mod 5) given by Andrews.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5666/KMJ.2021.61.1.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Abstract. Recently, Andrews introduced partition functions EO(n) and EO(n) where the function EO(n) denotes the number of partitions of n in which every even part is less than each odd part and the function EO(n) denotes the number of partitions enumerated by EO(n) in which only the largest even part appears an odd number of times. In this paper we obtain some congruences modulo 2, 4, 10 and 20 for the partition function EO(n). We give a simple proof of the first Ramanujan-type congruences EO (10n+ 8) ≡ 0 (mod 5) given by Andrews.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
