Question
If $a \equiv b(\bmod m)$ and the remainder obtained when $^{4}$ ' is divided by $m$ is 2 , then find the remainder when 'b' is divided by $\mathrm{m}$.(1) 2(2) 1(3) 0(4) Cannot be determined
Step 1
According to the concept of congruence modulo, this means that when $a$ and $b$ are divided by $m$, they will leave the same remainder. We can denote these remainders as $r_1$ and $r_2$ respectively. So, we have $r_1 = r_2$. Show more…
Show all steps
Your feedback will help us improve your experience
Kumareshwaran Rathinasabapathy and 68 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
If $(x-2)$ is a factor of $x^{2}+b x+1$ (where $b \in Q$ ), then find the remainder when $\left(x^{2}+b x+1\right)$ is divided by $2 x+3$. (1) 7 (2) 8 (3) 1 (4) 0
Without dividing out, find the remainder when $2 x^{2}-3 x+4$ is divided by $(x-2)$By the remainder theorem, the remainder is given by $a p^{2}+b p+c$, where $a=2, b=-3, c=4$ and $p=2$. Hence the remainder is: $$ 2(2)^{2}+(-3)(2)+4=8-6+4=6 $$
When the polynomial $m x^{3}-3 x^{2}+n x+2$ is divided by $x+3,$ the remainder is -1 When it is divided by $x-2,$ the remainder is $-4 .$ What are the values of $m$ and $n ?$
Polynomial Functions
The Remainder Theorem
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD