ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n>0n>0 be an integer and let x∈{0,1}nx\in\{0,1\}^n be a vector of bits of length nn. For each 1≤k≤n1\leq k\leq n, let qkq_k denote the kkth odd prime. Prime smoothness and prescribed valuations conjecture. There is a prime pp such that p−1p-1 is poly⁡(n)\operatorname{poly}(n)-smooth and, for every 1≤k≤n1\leq k\leq n, the kkth odd prime qkq_k divides p−1p-1 exactly xkx_k times.

This conjecture supplies primes whose factorization has both controlled smoothness and prescribed multiplicities for the first nn odd primes, as required by the paper's number-theoretic construction. Its status is not resolved in the supplied text.

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.