Let and and . What is the number of ways in which can be resolved as a product of two divisors which are relatively prime?
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.
First, N − 2 2 8 6 = f ( 4 ) − f ( − 4 ) = 3 ( 4 − ( − 4 ) ) = 2 4 , so N = 2 3 1 0 = 2 ⋅ 3 ⋅ 5 ⋅ 7 ⋅ 1 1 . This has 3 2 positive divisors, and they split into 1 6 pairs of relatively prime divisors which multiply together to give 2 3 1 0 .