Navvye/Olympiad-Problems-CSV huggingface dataset:
2020 Francophone Mathematical Olympiad
Let $(a_i)_{i\in \mathbb{N}}$ a sequence of positive integers, such that for any finite, non-empty subset $S$ of $\mathbb{N}$, the integer$$\Pi_{k\in S} a_k -1$$is prime.

Prove that the number of $a_i$'s with $i\in \mathbb{N}$ such that $a_i$ has less than $m$ distincts prime factors is finite.