ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(x)G(x) denote the number of primes in the set {⌊x/n⌋:1≤n≤x}\left\{\left\lfloor x/n\right\rfloor:1\le n\le x\right\}. Suppose that x=p1p2p3x=p_1p_2p_3, where p1,p2,p3p_1,p_2,p_3 are primes satisfying 2<p1<p2<p32<p_1<p_2<p_3. The three-prime floor-function set formula. Then

G(x)={G(x−1)if p1p2>p3,G(x−1)+1if p1p2<p3.G(x)=\begin{cases} G(x-1)&\text{if }p_1p_2>p_3,\\ G(x-1)+1&\text{if }p_1p_2<p_3. \end{cases}

This statement is presented as a generalisation suggested by a limited computational investigation; unlike the preceding prime and semiprime cases, no proof or resolution is supplied in the source.

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.