Sparse automatic set and zero-density automatic set intersection conjecture
Statement
Let and be multiplicatively independent positive integers. A subset of is sparse if its counting function is bounded by for some . Let be sparse and -automatic, and let be zero-density and -automatic. Sparse–zero-density intersection conjecture. The intersection is finite. The heuristic in the source uses the polynomial decay of the density of together with the rapidly growing enumeration of the sparse set ; the conjecture is presented as beyond current methods in number theory.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.