On the Parity of Additive Representation Functions

Let A be a set of positive integers,p(A,n) be the number of partitions ofnwith parts in A, andp(n)=p(N,n). It is proved that the number ofn⩽Nfor whichp(n) is even is ⪢N, while the number ofn⩽Nfor whichp(n) is odd is ⩾N1/2+o(1). Moreover, by using the theory of modular forms, it is proved (by J.-P. S...

Full description

Saved in:
Bibliographic Details
Published in:Journal of number theory 1998-12, Vol.73 (2), p.292-317
Main Authors: Nicolas, J.-L, Ruzsa, I.Z, Sárközy, A
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let A be a set of positive integers,p(A,n) be the number of partitions ofnwith parts in A, andp(n)=p(N,n). It is proved that the number ofn⩽Nfor whichp(n) is even is ⪢N, while the number ofn⩽Nfor whichp(n) is odd is ⩾N1/2+o(1). Moreover, by using the theory of modular forms, it is proved (by J.-P. Serre) that, for allaandmthe number ofn, such thatn≡a(modm), andn⩽Nfor whichp(n) is even is ⩾cNfor any constantc, andNlarge enough. Further a set A is constructed with the properties thatp(A,n) is even for alln⩾4 and its counting functionA(x) (the number of elements of A not exceedingx) satisfiesA(x)⪢x/logx. Finally, we study the counting function of sets A such that the number of solutions ofa+a′=n,a,a′∈A,a
ISSN:0022-314X
1096-1658
DOI:10.1006/jnth.1998.2288