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?
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault