Find the remainder when 5^{2009}+13^{2009} is divided by 18.
@amistre64
@phi and @kelliegirl33
I would look for a pattern of remainders when you divide 18 into 5, 5^1, 5^2, ... eventually it will start repeating. then reduce 5^2009 using modulo
i don't understand
can you list the remainders you get when you divide 18 into 5^0, 5^1, 5^2, 5^3, 5^4, 5^5, 5^6, 5^7 ?
can you give me shortest method to solve it? it seems to be longer
if you know a faster way, what is it ?
i don't know
mod 18 would have been my suggestions as well.
5^0, 5^1, 5^2, 5^3, 5^4, 5^5, 5^6, 5^7 ? rem: 1 5 7 17 13 11 1 5 it repeats modulo 6 for example 5^7/18 is the same as 5^(7 mod 6)/18 = 5/18 = 5 that means 5^2009 / 18 will have the same remainder as 5^n /18 where n = 2009 mod 6 = 5 looking at the table, we see 5^5/18 has a remainder of 11 now do the same thing for 13 add the two numbers, and find the remainder after dividing by 18
another quick way is to notice that, 'leaving 13 as remainder' is same as 'leaving -5 as remainder -5', so both terms wud simply cancel out giving u 0 : 5^{2009}+13^{2009} 5^{2009} - 5^{2009}
ooh, that is quicker. @ganeshie8
alternative : a^n + b^n = (a+b)(bla bla bla bla) for a,b are odd numbers so, 5^{2009}+13^{2009 = (5+13)(.........) = 18(.......) obvious, if it divided by 18, then its remainder is zero
yes, that is a good way too. @RadEn
@ganeshie8 can you explain your answer please ?
@RadEn if a,b are even no.then
@phi i don't understand your answer
@amistre64 , @UnkleRhaukus @mukushla
and i don't understand "mod" also ?What is the significance of this ?
yeah, it just for a,b are odd's
if a,b are even, is there any shortcut method?
i never see for a,b are even
ohkk
can you tell me what is "mod"?
\(\large 5^{2009}+13^{2009}\) first observation : if \(a\) leaves a remainder 'r' when divided by some number, then \(a^n\) leaves a remainder of \(r^n\) next : since \(13\) leaves a remainder of \(-5\) when divided by 18, \(13^{2009}\) leaves a remainder of \((-5)^{2009}\) plugging them cancels out the left hand side completely giving u 0
mod is just a notation referring to remainders : \(a \equiv b \mod n\) means \(a-b\) is divisible by \(n\)
-5? how?
not +5
13/18 = (18*1 - 5) / 18 = 1 R (-5) = 0 R (13)
leaving 13 remainder is same as saying leaving 13-18 = -5 remainder
okk
basically, we can have both negative and positive remainders
how?
2/3 = 0 R (2) = 1 R (-1)
when u divide 3 in 2, u can ask two questions : 1) how much im overflowing 2) how much im lacking
answer to first question gives u positive remainder answer to second question gives u negative remainder
both are correct in remainder arithmetic
so then, what you want to say ?
wat do u mean ?
i mean that the remainder is not +ve in this case,right?
u get to choose, if u wanto use positive / negative remainder when u talk about dividing wid 18 : 13 = -5 = 31 = 13 + 18k
more precicely : \(13 \equiv -5 \equiv 31 \mod 18\)
forget it, if that doesnt make sense... just see this :- 2/3 = 0 R (2) = 1 R (-1)
|dw:1392034817748:dw|
Join our real-time social learning platform and learn together with your friends!