In a sequence of numbers, a term is called golden if it is divisible by the term immediately before it. What is the maximum possible number of golden terms in a permutation of $1, 2, 3, . . . , 2021$?
Source: New Zealand MO 2021 Round 1 p3
Tags: number theory, divisible
In a sequence of numbers, a term is called golden if it is divisible by the term immediately before it. What is the maximum possible number of golden terms in a permutation of $1, 2, 3, . . . , 2021$?