A number theory problem by Akshat Sharda

Let a = ( n + 3 ) 3 n 1 a=\dfrac{(n+3)^3}{n-1} where a a and n n are integers.

Let the integral values of n n satisfying the above equation be n 1 , n 2 , n 3 , , n m n_{1},n_{2},n_{3}, \ldots, n_{m} .

Find ( p = 1 m n p ) + m \left(\displaystyle \sum^{m}_{p=1}n_{p}\right)+m .


The answer is 28.

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.

3 solutions

Let k = n 1 k = n - 1 . Then a = ( k + 4 ) 3 k = k 3 + 12 k 2 + 48 k + 64 k = k 2 + 12 k + 48 + 64 k a = \dfrac{(k + 4)^{3}}{k} = \dfrac{k^{3} + 12k^{2} + 48k + 64}{k} = k^{2} + 12k + 48 + \dfrac{64}{k} .

So a a will be an integer as long as k 64 k | 64 , i.e., for k = ± 1 , ± 2 , ± 4 , ± 8 , ± 16 , ± 32 , ± 64 k = \pm 1, \pm 2, \pm 4, \pm 8, \pm 16, \pm 32, \pm 64 .

We thus have m = 7 2 = 14 m = 7*2 = 14 , and since n = k + 1 n = k + 1 , while all the k k 's add to zero, the 14 14 n n 's will add to 14 1 = 14 14*1 = 14 . So the desired sum is 14 + 14 = 28 14 + 14 = \boxed{28} .

Aakash Khandelwal
Jan 23, 2016

n-1|64 therefore no. Of valyes of such n = divisors of 64. =7+7. Other 7 is for negative n. And sum of these values of n-1 is sum of positive and negative divisors of 64=0. Thefore sum of such n is 14. Hence answer=14*2

Exactly!!! did the same

Aditya Kumar - 5 years, 1 month ago

There is a theorem that affirmates that the rest of a polynom division P(n)/n-a is equal to P(a).Therefore,a=Q(n)+64/(n-1),where Q(n) is the quocient of (n+3)^3/(n-1) and 64=P(1).Thus, a belong to integers if,and only if,64/(n-1) is an integer,which means (n-1) is a divisor of 64.We know 64=2^6,so we have 14 solutions(7 positive and 7 negative).If we sort the solutions by a crescent order,the difference between a positive and a negative solution is equal 2.Then,The answer is 2.7+14=28

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...