ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers n2,…,n9n_2,\ldots,n_9, define the set of decimal integers with prescribed prime-factor data by

A:=dec⁡⟦123456789∗n2n3n4n5n6n7n8n9⟧.\mathcal{A}:=\operatorname{dec}\llbracket\begin{smallmatrix}1&2&3&4&5&6&7&8&9\\ *&n_2&n_3&n_4&n_5&n_6&n_7&n_8&n_9\end{smallmatrix}\rrbracket.

Here dec⁡\operatorname{dec} denotes the decimal-digit construction used in the paper. Bounded-power-of-two conjecture. There exists an integer aa such that the maximum power of two occurring in any x∈Ax\in\mathcal{A} is 2a2^a.

The conjecture is motivated by the proposed exhaustive-search approach for even targets, where an a priori unbounded power of two could weaken the filtering step. The paper reports this boundedness for all sets of interest there, but does not establish it in the stated generality.

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.