It's as easy as 1, 3, 5

Given that the remainder after dividing ( 10 n 2 + 13 ) (10{ n }^{ 2 }+13) by 4 is 3, where n n is a positive integer.

Let m m denote the sum of all such integers n n less than 1000. Find the remainder when m m is divided by 4.

4 6 1 3

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.

3 solutions

Aareyan Manzoor
Nov 28, 2014

10 = 2 ( m o d 4 ) , 13 = 1 ( m o d 4 ) 10=2 (mod 4), 13 = 1 ( mod 4) we get 1+2=3, if n is an even, then 10 n 2 = 0 ( m o d 4 ) 10n^2 = 0(mod 4) why, 10 = 5 × 2 10= 5 \times 2 an even has 2 as a divisor, so 10 n 2 = 5 × 2 × 2 × x 10n^2= 5 \times 2 \times 2 \times x 10 n 2 = 5 × 4 x , n = 0 ( m o d 2 ) 10n^2 =5\times 4x, n=0 (mod 2) it is divide able by 4, and would become 1 (m0d 4) so it is n = 1 ( M o d 2 ) n=1 (Mod 2) when an odd no. is divided by 4 the results are 1,3. so 1+3 4 \boxed{4}

Somoy Subandhu
Nov 17, 2014

As upon division of 10 n 2 + 13 10{ n }^{ 2 }+13 by 4 has the remainder 3, We can say that, 10 n 2 + 13 3 10{ n }^{ 2 }+13-3 is divisible by 4 ! Hence, 4 10 n 2 + 10 4|10{ n }^{ 2 }+10 or, 4 8 ( n 2 + 1 ) + 2 ( n 2 + 1 ) 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 ) 4|2({ n }^{ 2 }+1) hence, 2 ( n 2 + 1 ) 2|({ n }^{ 2 }+1) So, n^2+1 must be an even number . Here n 2 + 1 { 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

Chew-Seong Cheong
Nov 18, 2014

Since 10 n 2 + 13 3 ( m o d 4 ) 4 10 n 2 + 10 4 2 n 2 + 2 \quad 10n^2+13 \equiv 3 \pmod {4} \quad \Rightarrow 4|10n^2+10 \quad \Rightarrow 4|2n^2+2 .

For 2 n 2 + 2 2n^2+2 to be divisible by 4 4 , n n must be odd. As n n is odd then the possible remainders when divided by 4 4 are 1 1 and 3 3 , therefore the answer is 1 + 3 = 4 1+3 = \boxed {4} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...