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 · problems.science

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)$ .

Result history

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:90acbff280e35e808ca7139ddc6f4a089ad6bd7a47ebc5ad984294f6bdec0cb1
Metadata: sha256:d94a737dfac00eb2459d2bd8cad3b710435cce71cc9a7eaa59397798819ccafe
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:effb55915240ad2dcaf9414b6e4bd65d36e8fde9ab6db3aae16bbbff075824c1

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207

Upstream source Inspect records Source JSON

Result history

Correction history

Exact provenance

Search problems.science