Revision as of 19:29, 29 April 2009 by Jniederh (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


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

Questions/answers with a recent ECE grad

Ryne Rayburn