I used theorem 22.3 for this problem. Basically I just looked for the smallest n with 6 divisors. I got n=12.
--Jniederh 00:22, 30 April 2009 (UTC)

Alumni Liaison

Correspondence Chess Grandmaster and Purdue Alumni

Prof. Dan Fleetwood