ISL 1988 Problem 67
For each positive integer and let be the base digit sum of Prove that there are at most two primes less than for which are composite numbers with at least two distinct prime divisors.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.