If the integer n has exactly 3 positive divisors, including 1 and n, how many positive integers does n^2 have?
Question is asking a general rule. Hence you can use substitution.taim wrote:If the integer n has exactly 3 positive divisors, including 1 and n, how many positive integers does n^2 have?
Take for example: n=4
4 has divisors:1,2,4 = 3 divisors
4^2 =16 has 1,2,4,8,16 = 5 divisors
Hence answer should be 5 including 1 and n.
Hope this helps!!
