Divisibility with floor

Find sum of all integers n 4 n\ge 4 such that

n + 1 n 1 \left\lfloor \sqrt{n}\right\rfloor +1\mid n-1

and

n 1 n + 1 \left\lfloor \sqrt{n}\right\rfloor -1\mid n+1


The answer is 64.

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.

1 solution

Let m = n m=\left\lfloor \sqrt{n} \right\rfloor . Since n > 4 n>4 , then m 2 m\ge 2 is an integer.

We have m 2 n < ( m + 1 ) 2 {{m}^{2}}\le n<{{\left( m+1 \right)}^{2}} , so m 2 n m 2 + 2 m {{m}^{2}}\le n\le {{m}^{2}}+2m .

Set n = m 2 + k n={{m}^{2}}+k , with 0 k 2 m 0\le k\le 2m .

From m + 1 m 2 + k 1 m+1\mid{{m}^{2}}+k-1 we get m + 1 k m+1\mid k . On the other hand k < 2 ( m + 1 ) k<2\left( m+1 \right) , thus k = 0 k=0 or k = m + 1 k=m+1 .

If k = 0 k=0 , from m 1 m 2 + 1 m-1\mid{{m}^{2}}+1 follows m 1 2 m-1\mid2 , so m = 2 m=2 or m = 3 m=3 , hence n = 4 n=4 or n = 9 n=9 .

If k = m + 1 k=m+1 , from m 1 m 2 + m + 2 = ( m 1 ) ( m + 2 ) + 4 m-1\mid{{m}^{2}}+m+2=\left( m-1 \right)\left( m+2 \right)+4 follows m 1 4 m-1\mid4 . We obtain m = 2 m=2 or m = 3 m=3 or m = 5 m=5 , hence n = 7 n=7 or n = 13 n=13 or n = 31 n=31 .

So the sum of all possible value of n n is 4 + 7 + 9 + 13 + 31 = 64 4+7+9+13+31=\boxed{64} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...