Find the sum of all integers n such that ( n − 3 ) divides ( n 3 − 3 ) .
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.
Dividing n 3 − 3 by n − 3 gives a remainder of n − 3 2 4 . In order for the result to be an integer, the remainder must also be an integer, so all positive and negative factors of 2 4 are solutions to n − 3 .
2 4 has eight positive factors, so there are sixteen solutions to n − 3 . The sum of all n − 3 is clearly 0 ; for every positive solution, its opposite is also a solution.
To find the sum of all n , we just need to add 3 to all n − 3 . Because there are sixteen solutions to n − 3 , the sum of all n is 1 6 × 3 = 4 8
Problem Loading...
Note Loading...
Set Loading...
We need to find all n such that n − 3 ∣ n 3 − 3
We know n − 3 ∣ n 3 − 2 7 , So n − 3 ∣ ( n 3 − 3 ) − ( n 3 − 2 7 ) ⟹ n − 3 ∣ 2 4
Note we have a total of 1 6 divisors of 2 4 including negative divisors. The factor 3 helps to determine that the values of n so obtained for each pair of positive and negative divisors is 2 × 3 = 6 , For example n = 2 7 & n = − 2 1 are divisors of 24 which add upto 6 .
So for 8 divisors we have sum of all values 6 × 8 = 4 8