The bounded-power-of-two conjecture for decimal digit-product fibers
Statement
For integers , define the set of decimal integers with prescribed prime-factor data by
Here denotes the decimal-digit construction used in the paper. Bounded-power-of-two conjecture. There exists an integer such that the maximum power of two occurring in any is .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.