A number theory problem by Ilham Saiful Fauzi

Find the sum of all integers n n such that ( n 3 ) (n-3) divides ( n 3 3 ) (n^{3}-3) .


The answer is 48.

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.

2 solutions

We need to find all n n such that n 3 n 3 3 \displaystyle n-3 | n^3-3

We know n 3 n 3 27 \displaystyle n-3 | n^3-27 , So n 3 ( n 3 3 ) ( n 3 27 ) n 3 24 \displaystyle n-3 | (n^3-3)-(n^3-27) \implies n-3 | 24

Note we have a total of 16 16 divisors of 24 24 including negative divisors. The factor 3 helps to determine that the values of n n so obtained for each pair of positive and negative divisors is 2 × 3 = 6 2\times 3=6 , For example n = 27 n=27 & n = 21 n=-21 are divisors of 24 which add upto 6 6 .

So for 8 8 divisors we have sum of all values 6 × 8 = 48 \boxed{6\times 8=48}

Daniel Baton
Apr 11, 2019

Dividing n 3 3 n^{3} - 3 by n 3 n-3 gives a remainder of 24 n 3 \dfrac{24}{n-3} . In order for the result to be an integer, the remainder must also be an integer, so all positive and negative factors of 24 24 are solutions to n 3 n-3 .

24 24 has eight positive factors, so there are sixteen solutions to n 3 n-3 . The sum of all n 3 n-3 is clearly 0 0 ; for every positive solution, its opposite is also a solution.

To find the sum of all n n , we just need to add 3 3 to all n 3 n-3 . Because there are sixteen solutions to n 3 n-3 , the sum of all n n is 16 × 3 = 48 16\times 3= \fbox{48}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...