Let . How many factors of are less than , but do not divide ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let n = p 1 q 1 p 2 q 2 , which implies n 2 = p 1 2 q 1 p 2 2 q 2 for some prime p 1 , p 2 . The number of divisors of n is ( q 1 + 1 ) ( q 2 + 1 ) and n 2 is ( 2 q 1 + 1 ) ( 2 q 2 + 1 ) .
Consider the factors of n 2 other than n . Note that the number of such factors greater than n are equal to the factors less than n (If we group all of these factors (excluding n ) into pairs that multiply to n 2 , then one factor per pair is less than n ). Therefore the number of factors of n 2 less than n is 2 ( 2 q 1 + 1 ) ( 2 q 2 + 1 ) − 1 = 2 q 1 q 2 + q 1 + q 2 . Whereas the number of factors of n other than itself is ( q 1 + 1 ) ( q 2 + 1 ) − 1 = q 1 q 2 + q 1 + q 2
Thus the number of factors less than n but do not divide n are ( 2 q 1 q 2 + q 1 + q 2 ) − ( q 1 q 2 + q 1 + q 2 ) = q 1 q 2 . In this case q 1 q 2 = 2 3 × 1 7 = 3 9 1 .