# Whether p\equiv q\pmod m, when p=29,q=-34, and m=7.

mattgondek4 2021-05-09 Answered
Whether $$\displaystyle{p}\equiv{q}\pm{o}{d}{m}$$, when p=29,q=-34, and m=7.

### Expert Community at Your Service

• Live experts 24/7
• Questions are typically answered in as fast as 30 minutes
• Personalized clear answers

### Plainmath recommends

• Ask your own question for free.
• Get a detailed answer even on the hardest topics.
• Ask an expert for a step-by-step guidance to learn to do it yourself.

## Expert Answer

ensojadasH
Answered 2021-05-11 Author has 6665 answers
Definition used:
Congruence
Let m be an integer greater than 1. If x and y are integers, then x is congruent to y modulo m if x — y is divisible by m. It can be represented as $$\displaystyle{x}={y}\pm{o}{d}{m}$$. This relation is called as congruence modulo m.
Calculation:
Given numbers are p = 29,q = 34, and m =7.
For being congruence 29 - (-34) = 63 has to divisible by 7.
That is, 63 = 9*7+0.
Here, the remainder is 0. Therefore, 63 is divisible by 7.
Therefore, When p = 29,q = -34, and m = 7, $$\displaystyle{p}\equiv{q}\pm{o}{d}{m}$$.

### Expert Community at Your Service

• Live experts 24/7
• Questions are typically answered in as fast as 30 minutes
• Personalized clear answers

### Plainmath recommends

• Ask your own question for free.
• Get a detailed answer even on the hardest topics.
• Ask an expert for a step-by-step guidance to learn to do it yourself.
...