MathDB
19th kmo #7

Source: KMO round 2, problem 7

February 3, 2006
number theory unsolvednumber theory

Problem Statement

For a positive integer nn, let f(n)f(n) be the number of factors of n2+n+1n^2+n+1. Show that there are infinitely many integers nn which satisfy f(n)f(n+1)f(n) \geq f(n+1).