Given that the remainder after dividing ( 1 0 n 2 + 1 3 ) by 4 is 3, where n is a positive integer.
Let m denote the sum of all such integers n less than 1000. Find the remainder when m is divided by 4.
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.
As upon division of 1 0 n 2 + 1 3 by 4 has the remainder 3, We can say that, 1 0 n 2 + 1 3 − 3 is divisible by 4 ! Hence, 4 ∣ 1 0 n 2 + 1 0 or, 4 ∣ 8 ( n 2 + 1 ) + 2 ( n 2 + 1 )
Now , As the 5th rule of Divisibility, which is
If x|y and x|y+z then, x|z
.
By this rule we can say that,
4
∣
2
(
n
2
+
1
)
hence,
2
∣
(
n
2
+
1
)
So, n^2+1 must be an
even number
. Here
n
2
+
1
will be even only if
n^2 is odd
So, the possible values of n are
{1,3,5,7,9.......}
.
*As there is no even value of n , the only possible remainders of n upon division by 4 are 1 and 3 *
Hence , The Sum of the possible remainders is 1+3=4
Since 1 0 n 2 + 1 3 ≡ 3 ( m o d 4 ) ⇒ 4 ∣ 1 0 n 2 + 1 0 ⇒ 4 ∣ 2 n 2 + 2 .
For 2 n 2 + 2 to be divisible by 4 , n must be odd. As n is odd then the possible remainders when divided by 4 are 1 and 3 , therefore the answer is 1 + 3 = 4 .
Problem Loading...
Note Loading...
Set Loading...
1 0 = 2 ( m o d 4 ) , 1 3 = 1 ( m o d 4 ) we get 1+2=3, if n is an even, then 1 0 n 2 = 0 ( m o d 4 ) why, 1 0 = 5 × 2 an even has 2 as a divisor, so 1 0 n 2 = 5 × 2 × 2 × x 1 0 n 2 = 5 × 4 x , n = 0 ( m o d 2 ) it is divide able by 4, and would become 1 (m0d 4) so it is n = 1 ( M o d 2 ) when an odd no. is divided by 4 the results are 1,3. so 1+3 4