Prime Numbers and Divisors Problem

A problem involving prime numbers and finding divisors of numbers (exact statement not recalled by the candidate). General approach: sieve of Eratosthenes for primes up to a limit and/or divisor enumeration up to sqrt(n).