MathDB
Turkey Junior Olympiad 2009, Part II - P3

Source:

January 20, 2013

Problem Statement

The integer nn has exactly six positive divisors, and they are: 1<a<b<c<d<n1<a<b<c<d<n. Let k=aāˆ’1k=a-1. If the kk-th divisor (according to above ordering) of nn is equal to (1+a+b)b(1+a+b)b, find the highest possible value of nn.