Q5: Prove that: If a equiv b pmodn and c 0, then ca equiv cb pmodcn.

Name: Q5: Prove that: If a equiv b pmodn and c > 0, then ca equiv cb pmodcn.
Uploaded: 2023-06-06T15:03:45-08:00
Duration: 1 min 51 s
Channel: Adi S
Description: Q5: Prove that: If a equiv b pmodn and c > 0, then ca equiv cb pmodcn.

Question

Q5: Prove that: If a equiv b pmodn and c &gt; 0, then ca equiv cb pmodcn.

Suman Saurav Thakur · Accepted Answer

Given that a ≡ b (mod n), we know that n divides (a - b), which means there exists an integer k

Question

Q5: Prove that: If $a equiv b pmod{n}$ and $c > 0$, then $ca equiv cb pmod{cn}$.

Please give Ace some feedback