Find the sum of all positive integers n , such that n + 7 ( n + 1 ) 2 is an integer.
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.
We have to find all n such that
n + 7 ∣ ( n + 1 ) 2
n + 7 ∣ n 2 + 2 n + 1
n + 7 ∣ n ( n + 7 ) − 5 n + 1
n + 7 ∣ − 5 n + 1
n + 7 ∣ − 5 ( n + 7 ) + 3 6
n + 7 ∣ 3 6
We have to now find all factors of 36 greater than 7. These are 9, 12, 18 and 36. The values of n will therefore be 2, 5, 11 and 29. 2 + 5 + 1 1 + 2 9 = 4 7
n 2 + 2 n + 1 = ( n − 5 ) ( n + 7 ) + 3 6
7 n 2 + 2 n + 1 = ( n − 5 ) + n + 7 3 6
We have to find all possitive n sucha that n + 7 ∣ 3 6
n + 7 any divisor of 3 6 and n > 7
Divisors of 3 6 greater tha 7 are 9 , 1 2 , 1 8 , 3 6 ∴ n = 2 , 5 , 1 1 , 2 9
Sum is 2 + 5 + 1 1 + 2 9 = 4 7
Inevitably, similar to the solutions by Messrs Clement and Kesa; using the Python sympy library.
Synthetic division, then n-7 must divide the remainder. Sum over the positive possibilities.
I love how you can come up with a Python solution to almost all problems! :D
Thank you very much! But I can't do it with 'almost all'!
Problem Loading...
Note Loading...
Set Loading...
Firstly let x = n + 7 to make the equation easier to deal with.... x ( x − 6 ) 2 = x x 2 − 1 2 x + 3 6 = x − 1 2 + x 3 6 , so all we need to do is find the positive divisors of 36 which are x = 1 , 2 , 3 , 4 , 6 , 9 , 1 2 , 1 8 , 3 6 ⇒ n = 2 , 5 , 1 1 , 2 9 ∴ ∑ n = 4 7