Join
Representation functions growing exactly like log n
Is there a set A of naturals whose number of representations n = a + b is asymptotic to c·log n for some c > 0?
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.