Final answer:
The least number of flyers Adam could have distributed is 260.
Step-by-step explanation:
To find the least number of flyers Adam could have distributed, we need to find the least common multiple (LCM) of 13 and 20. The LCM is the smallest multiple both numbers share.
The prime factorization of 13 is 13, and the prime factorization of 20 is 2 * 2 * 5. To find the LCM, we need to take the highest power of each prime factor that appears in either number. In this case, we have 13 * 2 * 2 * 5 = 260.
Therefore, the least number of flyers Adam could have distributed is 260.