ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let rr be a positive integer, let n>1n>1 be an integer with n∈Frn\in F_r, and let P1(n)P_1(n) denote the smallest prime divisor of nn. Cubic prime-divisor conjecture.

P1(n)3∤n.P_1(n)^3\nmid n.

This generalizes the result of Masser and Shiu that P1(n)3∤nP_1(n)^3\nmid n for sparsely totient numbers. The supplied context proves the weaker assertion that P1(n)4∤nP_1(n)^4\nmid n for sufficiently large n∈Frn\in F_r, while the stated cubic-divisibility claim remains open.

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.