Let $g(n)$ denote the largest $t$ such that there exist integers $2\leq a_1 P(a_2)>\cdots >P(a_t)$$ where $P(m)$ is the greatest prime factor of $m$. Estimate $g(n)$.

Erdős problem 648

Let $g(n)$ denote the largest $t$ such that there exist integers $2\leq a_1<a_2<\cdots <a_t <n$ such that $P(a_1)>P(a_2)>\cdots >P(a_t)$ where $P(m)$ is the greatest prime factor of $m$ . Estimate $g(n)$ .

1 of 6 recorded

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:90acbff280e35e808ca7139ddc6f4a089ad6bd7a47ebc5ad984294f6bdec0cb1
Metadata: sha256:d94a737dfac00eb2459d2bd8cad3b710435cce71cc9a7eaa59397798819ccafe
Observation: sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content: sha256:effb55915240ad2dcaf9414b6e4bd65d36e8fde9ab6db3aae16bbbff075824c1

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit: 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb