ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer. The nn-divisor property means that every integer from 11 through nn divides at least one member of a specified product. The generalized arithmetic-progression divisor conjecture. There exist c=O~(log⁡n)c=\widetilde{O}(\log n) integers A1,…,AcA_1,\ldots,A_c, each of size O~(nn1/3)\widetilde{O}(n^{n^{1/3}}), and integers m1,…,mc≥0m_1,\ldots,m_c\ge0 such that

1,…,n∣∏i1,…,ic=1m1,…,mc(B+i1A1+⋯+icAc),1,\ldots,n\mid\prod_{i_1,\ldots,i_c=1}^{m_1,\ldots,m_c}\left(B+i_1A_1+\cdots+i_cA_c\right),

with ∏i=1cmi=O~(n2/3)\prod_{i=1}^{c}m_i=\widetilde{O}(n^{2/3}); equivalently, the index tuples lie in a hypercube of volume O~(n2/3)\widetilde{O}(n^{2/3}).

This generalizes the arithmetic-progression formulation and is proposed as a possible route to improved factorization algorithms. The source says these conjectures are unproved and gives no resolution evidence.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.