ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p<q<rp<q<r be primes and let b>1b>1. The divisibility and lower-bound conjecture. For n=pqrbn=pqr^b, the value B(n)B(n) is divisible by pp and satisfies

B(n)>p.B(n)>p.

This conjecture is motivated by the failure of the analogous divisibility statement for square-free nn. The source offered it as a further conjecture; no proof or resolution was given.

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.