⌊ n ⌉ 2 + 2 n 2 + 1
Find the sum of all positive integers n such that the expression above is an integer.
Notation: ⌊ ⋅ ⌉ denotes the nearest integer function.
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.
@Priyanshu Mishra you have changed the notation after posting my solution.Initially the symbol is [ . ] .you have changed it to ⌊ . ⌋ .I have worked hard to write this solution.Please be careful while writting problem from the next time either it will kill my time.
Kushal, I've posted the "original" version of the problem and moved your solution over.
I've cleaned up and made some changes to your solution.
Problem Loading...
Note Loading...
Set Loading...
Case 1: n = k 2 . [ n ] = k .
[ n ] 2 + 2 n 2 + 1 = k 2 + 2 k 4 + 1 = k 2 − 2 + k 2 + 2 5
For this to be an integer, k 2 + 2 5 must be an integer, which we can check is not possible.
Case 2: k 2 + 1 ≤ n ≤ k 2 + k then [ n ] = k . Let n = k 2 + r with 1 ≤ r ≤ k .
[ n ] 2 + 2 n 2 + 1 = k 2 + 2 ( k 2 + r ) 2 + 1 = k 2 + 2 ( k 2 + 2 + r − 2 ) 2 + 1 = k 2 + 2 ( k 2 + 2 ) 2 + 2 ( k 2 + 2 ) ( r − 2 ) + ( r − 2 ) 2 + 1
So, k 2 + 2 ( r − 2 ) 2 + 1 should be an integer. However, since 1 ≤ ( r − 2 ) 2 + 1 < k 2 + 2 , hence the fraction is strictly between 0 and 1. Thus, there are no solutions.
Case 3: k 2 + k + 1 ≤ n ≤ k 2 + 2 k then [ n ] = k + 1 . Let n = ( k + 1 ) 2 − r with 1 ≤ r ≤ k .
[ n ] 2 + 2 n 2 + 1 = ( k + 1 ) 2 + 2 ( ( k + 1 ) 2 − r ) 2 + 1 = ( k + 1 ) 2 + 2 ( ( k + 1 ) 2 + 2 − r − 2 ) 2 + 1 = ( k + 1 ) 2 + 2 ( ( k + 1 ) 2 + 2 ) 2 − 2 ( ( k + 1 ) 2 + 2 ) ( r + 2 ) + ( r + 2 ) 2 + 1
So ( k + 1 ) 2 + 2 ( r + 2 ) 2 + 1 must be an integer. For r ≤ k − 1 , we have 1 ≤ ( r + 2 ) 2 + 1 < ( k + 1 ) 2 + 2 , hence the fraction is strictly between 0 and 1.
It remains to check that case of r = k . Substituting this in, we get that k 2 + 2 k + 3 k 2 + 4 k + 5 = 1 + k 2 + 2 k + 3 2 ( k + 1 ) is an integer. However, we see that the fraction is between 0 and 1, hence is never an integer for positive k . Thus, there are no solutions.