Answer
Verified
464.1k+ views
Hint: Let the number be n. Use Euclid's division lemma with a = n and b = 143. Write 31 as 26+5 and take 13 common from the first two terms. Hence find the remainder obtained on dividing by 13.
Alternatively, you can use the property that if $a\equiv b\bmod m$ and n divides m then $a\equiv b\bmod n$.
Use the fact that if $a\equiv b\bmod m$ thenn$a\equiv b-cm\bmod m$, where c is an integer.
Hence find the remainder on dividing by 13.
Complete step-by-step answer:
We know from Euclid's division lemma if r is the remainder on dividing a by b then
a = bq+r.
Let n be the given number.
Hence n = 143q+31
Hence n = 143q+26+5
Taking 13 common from the first two terms, we get
n = 13(11q+2) +5
i.e. n = 13s+5 where s is an integer.
Since $0\le 5<13$we have
The remainder on dividing n by 13 is 5.
Hence option [d] is correct.
Note: Let n be the given number.
Hence $n\equiv 31\bmod 143$
We know that if $a\equiv b\bmod m$ and n divides m then $a\equiv b\bmod n$.
Since 13 divides 143, using the above property, we get
$\begin{align}
& n\equiv 31\bmod 13 \\
& \Rightarrow n\equiv 5\bmod 13 \\
\end{align}$
Hence the remainder obtained on dividing the number by 13 is 5.
Hence option [d] is correct.
Alternatively, you can use the property that if $a\equiv b\bmod m$ and n divides m then $a\equiv b\bmod n$.
Use the fact that if $a\equiv b\bmod m$ thenn$a\equiv b-cm\bmod m$, where c is an integer.
Hence find the remainder on dividing by 13.
Complete step-by-step answer:
We know from Euclid's division lemma if r is the remainder on dividing a by b then
a = bq+r.
Let n be the given number.
Hence n = 143q+31
Hence n = 143q+26+5
Taking 13 common from the first two terms, we get
n = 13(11q+2) +5
i.e. n = 13s+5 where s is an integer.
Since $0\le 5<13$we have
The remainder on dividing n by 13 is 5.
Hence option [d] is correct.
Note: Let n be the given number.
Hence $n\equiv 31\bmod 143$
We know that if $a\equiv b\bmod m$ and n divides m then $a\equiv b\bmod n$.
Since 13 divides 143, using the above property, we get
$\begin{align}
& n\equiv 31\bmod 13 \\
& \Rightarrow n\equiv 5\bmod 13 \\
\end{align}$
Hence the remainder obtained on dividing the number by 13 is 5.
Hence option [d] is correct.
Recently Updated Pages
How many sigma and pi bonds are present in HCequiv class 11 chemistry CBSE
Mark and label the given geoinformation on the outline class 11 social science CBSE
When people say No pun intended what does that mea class 8 english CBSE
Name the states which share their boundary with Indias class 9 social science CBSE
Give an account of the Northern Plains of India class 9 social science CBSE
Change the following sentences into negative and interrogative class 10 english CBSE
Trending doubts
A group of fish is known as class 7 english CBSE
The highest dam in India is A Bhakra dam B Tehri dam class 10 social science CBSE
Write all prime numbers between 80 and 100 class 8 maths CBSE
Fill the blanks with the suitable prepositions 1 The class 9 english CBSE
Onam is the main festival of which state A Karnataka class 7 social science CBSE
Who administers the oath of office to the President class 10 social science CBSE
Differentiate between homogeneous and heterogeneous class 12 chemistry CBSE
Kolkata port is situated on the banks of river A Ganga class 9 social science CBSE
Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE