Don't forget to count the negatives!

If N N is an integer such that it is divisible by precisely 4 distinct integers.

Then, N 2 N^2 is divisible by precisely _______ \text{\_\_\_\_\_\_\_} distinct integers.

10 8 12 6

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.

1 solution

Any integer N N such that N 1 |N| \ne 1 will be divisible, at the very least, by 4 distinct integers, namely N , 1 , 1 -N, -1, 1 and N N . If these are the only divisors, then as the only distinct positive divisors of N |N| are 1 1 and N |N| we can conclude that N |N| is prime, in which case N 2 N^{2} will only be divisible by N 2 , N , 1 , 1 , N -N^{2}, -N, -1, 1, N and N 2 N^{2} , a total of 6 \boxed{6} distinct integer divisors.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...