When a positive integer n is divided by 13, what is theremainder?
STAT 1 : n+1 is divisible by13
Theory: Dividend = Divisor*Quotient +Remainder
n+1 -> Dividend
13 -> Divisor
a -> Quotient (Assume)
0 -> Remainder
=> n+1 = 13*a + 0 = 13a
=> n = 13a - 1
=> n when divided by 13 gives 12 (i.e. 13-1) as remainder
=>SUFFICIENT
STAT 2 : n+14 is divisible by13
n+14 -> Dividend
13 -> Divisor
b -> Quotient (Assume)
0 -> Remainder
=> n+14 = 13*b + 0 = 13b
=>
...
STAT 1 : n+1 is divisible by13
Theory: Dividend = Divisor*Quotient +Remainder
n+1 -> Dividend
13 -> Divisor
a -> Quotient (Assume)
0 -> Remainder
=> n+1 = 13*a + 0 = 13a
=> n = 13a - 1
=> n when divided by 13 gives 12 (i.e. 13-1) as remainder
=>SUFFICIENT
STAT 2 : n+14 is divisible by13
n+14 -> Dividend
13 -> Divisor
b -> Quotient (Assume)
0 -> Remainder
=> n+14 = 13*b + 0 = 13b
=>
...
