Andrews配分函数EO（n）的若干同余性

IF 0.6 Q3 MATHEMATICS

Kyungpook Mathematical Journal Pub Date : 2021-03-01 DOI:10.5666/KMJ.2021.61.1.49

S. N. Fathima, U. Pore

{"title":"Andrews配分函数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":46188,"journal":{"name":"Kyungpook Mathematical Journal","volume":"61 1","pages":"49-59"},"PeriodicalIF":0.6000,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"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\":46188,\"journal\":{\"name\":\"Kyungpook Mathematical Journal\",\"volume\":\"61 1\",\"pages\":\"49-59\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2021-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kyungpook Mathematical Journal\",\"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\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kyungpook Mathematical Journal","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":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 1

摘要

摘要最近，Andrews引入了配分函数EO（n）和EO（n。本文得到了配分函数EO（n）模2，4，10和20的一些同余。我们给出了Andrews给出的第一个Ramanujan型同余EO（10n+8）lect 0（mod 5）的一个简单证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Some Congruences for Andrews’ Partition Function EO(n)

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Kyungpook Mathematical Journal MATHEMATICS-

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Kyungpook Mathematical Journal is an international journal devoted to significant research concerning all aspects of mathematics. The journal has a preference for papers having a broad interest. One volume of the journal is published every year. Each volume until volume 42 consisted of two issues; however, starting from volume 43(2003), each volume consists of four issues. Authors should strive for expository clarity and good literary style. Manuscripts should be prepared as follows. The first page must consist of a short descriptive title, followed by the name(s) and address(es) of the author(s) along with an electronic address if available.