Problem

Source: JBMO Shortlist 2023, N5

Tags: JBMO, JBMO Shortlist, number theory



Find the largest positive integer $k$ such that we can find a set $A \subseteq \{1,2, \ldots, 100 \}$ with $k$ elements such that, for any $a,b \in A$, $a$ divides $b$ if and only if $s(a)$ divides $s(b)$, where $s(k)$ denotes the sum of the digits of $k$.