ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g(n)g(n) be the quantity associated with corresponding sequences, and suppose the established upper bound is g(n)≤2ng(n)\leq 2n.

Equality characterization conjecture. The upper bound is attained,

g(n)=2n,g(n)=2n,

if and only if nn is prime or n=6n=6.

The conjecture follows results showing that the bound g(n)≤2ng(n)\leq 2n is sharp, and proposes that equality occurs only for prime inputs and the exceptional value n=6n=6.

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.