On Erdos problem \# 648
Abstract
We establish the order of the maximum length of an increasing sequence, bounded by n, in which the largest prime divisor of the elements form a decreasing sequence.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.