need to prove that:

if m, d, and k are nonnegative integers and d does not equal 0, then (m + dk) mod d = m mod d.

I'm pretty sure you need to use the quotient remainder theorem.

thanks in advance.

Printable View

- Feb 23rd 2010, 05:10 PMMathwizard4Need help on an easy proof
need to prove that:

if m, d, and k are nonnegative integers and d does not equal 0, then (m + dk) mod d = m mod d.

I'm pretty sure you need to use the quotient remainder theorem.

thanks in advance. - Feb 23rd 2010, 05:18 PMicemanfan
$\displaystyle m + dk \mod d \equiv m \mod d + dk \mod d \equiv m \mod d + 0 \mod d \equiv m \mod d$. Is there any reason you can't use this argument?

- Feb 23rd 2010, 05:39 PMMathwizard4
how do you know (m + dk) mod d = m mod d + dk mod d?

is that a rule that works for all integers?

also

wouldn't m mod + 0 mod d = m mod d + d and not m mod d - Feb 23rd 2010, 05:48 PMicemanfan
- Feb 23rd 2010, 05:52 PMMathwizard4
ok thanks but what about this

wouldn't m mod + 0 mod d = m mod d + d and not m mod d http://www.mathhelpforum.com/math-he...c/progress.gif ? - Feb 23rd 2010, 05:55 PMicemanfan
- Feb 23rd 2010, 06:08 PMMathwizard4
how do you know....

$\displaystyle m \mod d + dk \mod d \equiv m \mod d + 0 \mod d$ - Feb 23rd 2010, 08:37 PMMathwizard4
can anyone else help?

- Feb 23rd 2010, 09:22 PMdiscreteDilemaanswer?
sorry to hop on your thread with a question, but did you ever figure out how to prove that? I have the same exact problem and cannot figure it out at all, driving me insane and its due in about 6 hours

- Feb 23rd 2010, 09:30 PMMathwizard4