Proof using Modulus

Discussion in 'Homework Help' started by corsair, Mar 30, 2010.

  1. corsair

    Thread Starter Member

    Mar 6, 2010
    51
    1
    Hi guys, I need help with this proof. I'm not sure how to get started:

    Prove that (u/v)%p = (u/v)%q for any two numbers u and v < p, q, where v divides u evenly and p and q are prime numbers.

    nm dont worry about this, someone explained it to me
     
    Last edited: Mar 30, 2010
Loading...