Remainders of Multiples

Number Theory Level pending

True or False?

For any triplets of integers ( a , b , c ) (a, b, c) satisfying b c 0 bc\neq0 , if r r is the remainder of a a when divided by b b , then c r cr is the remainder of c a ca when divided by c b cb .

True False

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.

1 solution

False is the answer.

a = b q + r a=bq+r , with 0 r < b 0 \leq r < \mid b \mid .

Now consider the integers c < 0 c<0 .

Then c a = ( c b ) q + ( c r ) ca=(cb)q+(cr) , but the inequality 0 c r < c b 0 \leq cr <\mid cb \mid doesn't hold as c < 0 c r < 0 c<0 \implies cr<0 .

For example, when a = 10 , b = 7 a=10, b=7 , r = 3 r=3 . Now, consider c = 2 c=-2 : c r = 6 cr=-6 isn't the remainder of c a = 20 ca=-20 when divided by c b = 14 cb=-14 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...