ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a non-zero integer mm, let rad⁡(m)\operatorname{rad}(m) be its largest square-free positive divisor. For n≥3n\geq 3 and a=(a1,…,an)∈Zna=(a_1,\ldots,a_n)\in\mathbb{Z}^n with all ai≠0a_i\neq 0, define

q(a)=log⁡(max⁡(∣a1∣,…,∣an∣))log⁡rad⁡(a1⋯an).q(a)=\frac{\log(\max(|a_1|,\ldots,|a_n|))}{\log\operatorname{rad}(a_1\cdots a_n)}.

For a sequence A={a(1),a(2),…}⊆ZnA=\{a^{(1)},a^{(2)},\ldots\}\subseteq\mathbb{Z}^n, define

QA=lim sup⁡k→∞q(a(k)).Q_A=\limsup_{k\rightarrow\infty}q(a^{(k)}).

Let A(n)⊆ZnA(n)\subseteq\mathbb{Z}^n be the set of nn-tuples satisfying (Z) a1+⋯+an=0a_1+\cdots+a_n=0, (S1) no nontrivial subsum with coefficients in {0,1}\{0,1\} vanishes, and (G1) gcd⁡(a1,…,an)=1\operatorname{gcd}(a_1,\ldots,a_n)=1. The Browkin–Brzeziński nn-conjecture. For every n≥3n\geq 3, one has

QA(n)=2n−5.Q_{A(n)}=2n-5.

This is one of the strong nn-conjectures studied over the rational integers; the supplied material does not state whether it has been resolved.

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.