A number N when divided by 9 leaves the remainder of 5.
Find the remainder when the same number N is divided by 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.
I am a Brilliant's moderator. I have edited your problem. Brilliant's standards have it that numbers on their own in a problem should not be in LaTex. Text should not be in LaTex. My solution format has no choice but to be in LaTex.
N 9 n + 5 ≡ 5 (mod 9) ≡ 2 (mod 3) Let N = 9 n + 5 , where n is an integer.
@Chew-Seong Cheong Please explain "Let N=9n+8, where n is an integer". I think it should "Let N=9n+5 where n is an integer"
Log in to reply
Sorry, it was a typo. It should be 5 and not 8. That is why the next line.
Problem Loading...
Note Loading...
Set Loading...
Using Euclid's division lemma
N = 9 m + 5 N = 3 × 3 m + 5 N = 3 × 3 m + 3 + 2 N = 3 ( 3 m + 1 ) + 2 N = 3 q + 2 (q = 3m+1) ∴ T h e r e m a i n d e r i s 2