http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Some Congruences for Andrews’ Partition Function EO(n)
Utpal Pore,Syeda Noor Fathima 경북대학교 자연과학대학 수학과 2021 Kyungpook mathematical journal Vol.61 No.1
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.