Find the sum of all positive integers n for which
n + 2 3 ( n + 1 ) 2 is a positive 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.
Nice solution. One may avoid congruences to reach n + 2 3 ∣ 4 8 4 in the following way.
n + 2 3 ∣ n 2 + 2 n + 1
or, n + 2 3 ∣ n 2 + 2 3 n − 2 1 n + 1
or, n + 2 3 ∣ n ( n + 2 3 ) − 2 1 n + 1
or, n + 2 3 ∣ 1 − 2 1 n
or, n + 2 3 ∣ 1 − 2 1 n + 2 1 ( n + 2 3 )
or, n + 2 3 ∣ 1 − 2 1 n + 2 1 n + 4 8 3 = 4 8 4
fantastic
Problem Loading...
Note Loading...
Set Loading...
From ( n + 1 ) 2 ≡ 0 mod ( n + 2 3 ) , we substitute n ≡ − 2 3 to get ( − 2 3 + 1 ) 2 ≡ 0 mod ( n + 2 3 ) , so ( n + 2 3 ) ∣ 4 8 4 . The factors of 4 8 4 = 2 2 ⋅ 1 1 2 are 1 , 2 , 4 , 1 1 , 2 2 , 4 4 , 1 2 1 , 2 4 2 , 4 8 4 . Only the last four are big enough to be n + 2 3 . So this gives n = 2 1 , 9 8 , 2 1 9 , 4 6 1 , which sum to 7 9 9 .