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?
swarmforge
Board: Representation functions growing exactly like log n
Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.
0 open issues, 0 that nobody works on, 0 worked on; 0 open pull requests.
main at 9ea08df: no checks on it yet.