Solution

(c) We know that, even integers are 2, 4, 6,..

So, it can be written in the form of $2m$.

where,

$\begin{array}{rl}& m=\text{ Integer }=Z[\text{ since, integer is represented by }Z]\\ & m=\cdots ,-1,0,1,2,3,\dots \end{array}$

$\begin{array}{cc}\text{ or }& m=\cdots ,-1,0,1,2,3,\dots \\ \therefore & 2m=\cdots ,-2,0,2,4,6..\end{array}$

Alternate Method

Let ’ $a$ ’ be a positive integer. On dividing ’ $a$ ’ by 2 , let $m$ be the quotient and $r$ be the remainder. Then, by Euclid’s division algorithm, we have

$a=2m+r\text{, where }a\le r<2\text{ i.e., }r=0\text{ and }r=1\text{. }$

$\Rightarrow a=2m\text{ or }a=2m+1$

when, $a=2m$ for some integer $m$, then clearly $a$ is even.

Solution

(d) We know that, odd integers are 1, 3, 5, ,

So, it can be written in the form of $2q+1$.

where,

or

$q=\text{ integer }=Z$

Alternate Method

Let ’ $a$ ’ be given positive integer. On dividing ’ $a$ ’ by 2 , let $q$ be the quotient and $r$ be the remainder. Then, by Euclid’s division algorithm, we have

$\begin{array}{cc}\Rightarrow & a=2q+r,\text{ where }0\le r<2\\ \Rightarrow & a=2q+r,\text{ where }r=0\text{ or }r=1\\ \Rightarrow & a=2q\text{ or }2q+1\end{array}$

when $a=2q+1$ for some integer $q$, then clearly $a$ is odd.

Solution

(c) Let $a=n^2-1$

Here $n$ can be ever or odd.

Case I $n=$ Even i.e., $n=2k$, where $k$ is an integer.

$\begin{array}{cc}\Rightarrow & a=(2k{)}^2-1\\ \Rightarrow & a=4k^2-1\end{array}$

At $k=-1,=4(-1{)}^2-1=4-1=3$, which is not divisible by 8 .

At $k=0,a=4(0{)}^2-1=0-1=-1$, which is not divisible by 8 , which is not

Case II $n=$ Odd i.e., $n=2k+1$, where $k$ is an odd integer.

$$\begin{array}{ll}\Rightarrow & a=2k+1\\ \Rightarrow & a=(2k+1{)}^2-1\\ \Rightarrow & a=4k^2+4k+1-1\\ \Rightarrow & a=4k^2+4k\\ \Rightarrow & a=4k(k+1)\end{array}$$

$\begin{array}{c}\text{ At }k=-1,a=4(-1)(-1+1)=0\text{ which is divisible by }8.\\ \text{ At }k=0,a=4(0)(0+1)=4\text{ which is divisible by }8.\\ \text{ At }k=1,a=4(1)(1+1)=8\text{ which is divisible by }8.\\ \text{ Hence, we can conclude from above two cases, if }n\text{ is odd, then }{n}^2-1\text{ is }\\ \text{ divisible by }8.\end{array}$

Thinking Process

Apply Euclid’s division algorithm until the remainder is 0 . Finally we get divisor, which is the required HCF of 65 and 117. Now, put $65m-117=HCF(65,117)$ and get the value of $m$.

Solution

(b) By Euclid’s division algorithm,

$$\begin{array}{rl}& b=aq+r,0\le r<a[\because \text{ dividend }=\text{ divisor }\times \text{ quotient }+\text{ remainder }]\\ & \Rightarrow 117=65\times 1+52\\ & \Rightarrow 65=52\times 1+13\\ & \Rightarrow 52=13\times 4+0\\ & \therefore \mathrm{HCF}(65,117)=13\\ & \text{ Also, given that, }\mathrm{HCF}(65,117)=65m-117\\ & 65m-117=13\\ & \Rightarrow 65m=130\\ & \Rightarrow m=2\\ & \end{array}$$

From Eqs. (i) and (ii),

$$\begin{array}{lll}& 65m-117& =13\\ \Rightarrow & 65m& =130\\ \Rightarrow & m& =2\end{array}$$

Thinking Process

First, we subtract the remainders 5 and 8 from corresponding numbers respectively and then get HCF of resulting numbers by using Euclid’s division algorithm, which is the required largest number.

Solution

(a) Since, 5 and 8 are the remainders of 70 and 125 , respectively. Thus, after subtracting these remainders from the numbers, we have the numbers $65=(70-5)$, $117=(125-8)$, which is divisible by the required number.

Now, required number $=HCF$ of 65,117

[for the largest number]

For this, $117=65\times 1+52[\because$ dividend $=$ divisor $\times$ quotient + remainder $]$

$\Rightarrow$ $65=52\times 1+13$

$\Rightarrow 52=13\times 4+0$

$\therefore HCF=13$

Hence, 13 is the largest number which divides 70 and 125 , leaving remainders 5 and 8 .

Solution

(b) Given that,

$a=x^3{y}^2=x\times x\times x\times y\times y$

and

$b=x{y}^3=x\times y\times y\times y$

$\therefore$ HCF of $a$ and $b$

$=HCF(x^3{y}^2,x{y}^3)=x\times y\times y=x{y}^2$

[since, HCF is the product of the smallest power of each common prime facter involved in the numbers]

Solution

(c) Given that,

$p=a{b}^2=a\times b\times b$

and

$q=a^{3}b=a\times a\times a\times b$

$\therefore$ LCM of $p$ and $q=LCM(a{b}^2,a^{3}b)=a\times b\times b\times a\times a=a^3{b}^2$

[since, LCM is the product of the greatest power of each prime factor involved in the numbers]

Solution

(a) Product of a non-zero rational and an irrational number is always irrational i.e., $\frac{3}{4}\times \sqrt{2}=\frac{3\sqrt{2}}{4}$ (irrational).

Solution

(d) Factors of 1 to 10 numbers

$$\begin{array}{rl}& 1=1\\ & 2=1\times 2\\ & 3=1\times 3\\ & 4=1\times 2\times 2\\ & 5=1\times 5\\ & 6=1\times 2\times 3\\ & 7=1\times 7\\ & 8=1\times 2\times 2\times 2\\ & 9=1\times 3\times 3\\ & 10=1\times 2\times 5\end{array}$$

$$\begin{gathered} \therefore \text{LCM of number }1\text{ to }10=LCM(1,2,3,4,5,6,7,8,9,10) \\ =1\times 2\times 2\times 2\times 3\times 3\times 5\times 7=2520 \end{gathered}$$

Thinking Process

In terminating rational number the denominator always have the form $2^m\times 5^n$.

Solution

(d) Rational number $=\frac{14587}{1250}=\frac{14587}{2^1\times 5^4}$

$\begin{array}{rl}& =\frac{14587}{10\times 5^3}\times \frac{(2{)}^3}{(2{)}^3}\\ & =\frac{14587\times 8}{10\times 1000}\\ & =\frac{116696}{10000}=11.6696\end{array}$

Hence, given rational number will terminate after four decimal places.

Solution

No, by Euclid’s Lemma, $b=aq+r,0\le r<a[\because$ dividend $=$ divisor $\times$ quotient + remainder $]$ Here, $b$ is any positive integer $a=4,b=4q+r$ for $0\le r<4$ i.e., $r=0,1,2,3$

So, this must be in the form $4q,4q+1,4q+2$ or $4q+3$.

Thinking Process

The product of two consecutive numbers i.e., $n(n+1)$ will always be even, as one out of $n$ or $(n+1)$ must be even.

Solution

Yes, two consecutive integers can be $n,(n+1)$. So, one number of these two must be divisible by 2 . Hence, product of numbers is divisible by 2 .

Solution

Yes, three consecutive integers can be $n,(n+1)$ and $(n+2)$.

So, one number of these three must be divisible by 2 and another one must be divisible by 3. Hence, product of numbers is divisible by 6 .

Solution

No, by Euclid’s lemma, $b=aq+r,0\le r\le a$ Here, $b$ is any positive integer, $a=3,b=3q+r$ for $0\le r\le 2$

So, any positive integer is of the form $3k,3k+1$ or $3k+2$.

Now, $$\begin{array}{rlr}(3k{)}^2& =9k^2=3m& [\text{where, }m=3K^2]\\ (3k+1{)}^2& =9k^2+6k+1\\ & =3(3k^2+2k)+1=3m+1& [where,m=3k^2+2k]\end{array}$$

Also

$$\begin{array}{rl}(3k+2{)}^2& =9k^2+12k+4[\because (a+b{)}^2=a^2+2ab+b^2]\\ & =9k^2+12k+3+1\\ & =3(3k^2+4k+1)+1\\ & =3m+1\text{ [where, }m=3k^2+4k+1]\end{array}$$

which is in the form of $3m$ and $3m+1$. Hence, square of any positive number cannot be of the form $3m+2$.

Solution

No, by Euclid’s Lemma, $b=aq+r,0\le r<a$

Here, $b$ is any positive integer $a=3,b=3q+r$ for $0\le r<3$

So, this must be in the form $3q,3q+1$ or $3q+2$.

Now, $$\begin{array}{rlr}(3q{)}^2& =9q^2=3m& [here,m=3q^2]\\ (3q+1{)}^2& =9q^2+6q+1& \\ & =3(3q^2+2q)+1=3m+1& [wherem=3q^2+2q]\end{array}$$ Also, $$\begin{array}{rl}(3q+2{)}^2& =9q^2+12q+4\\ & =9q^2+12q+3+1\\ & =3(3q^2+4q+1)+1\\ & =3m+1& [here,m=3q^2+4q+1]\end{array}$$

Hence, square of a positive integer is of the form $3q+1$ is always in the form $3m+1$ for some integer $m$.

Solution

Since, the $HCF(525,3000)=75$

By Euclid’s Lemma, $3000=525\times 5+375[\because$ dividend $=$ divisor $\times$ quotient + remainder $]$

$525=375\times 1+150$

$375=150\times 2+75$

$150=75\times 2+0$

and the numbers $3,5,15,25$ and 75 divides the numbers 525 and 3000 that mean these terms are common in both 525 and 3000 . So, the highest common factor among these is 75 .

Thinking Process

A number which has more than two factors is known as a composite number.

Solution

We have, $3\times 5\times 7+7=105+7=112$

Now, $112=2\times 2\times 2\times 2\times 7=2^4\times 7$

So, it is the product of prime factors 2 and 7 . i.e., it has more than two factors.

Hence, it is a composite number.

Solution

No, because HCF is always a factor of LCM but here 18 is not a factor of 380 .

Solution

Yes, after simplification denominator has factor $5^3\cdot 2^2$ and which is of the type $2^m\cdot 5^n$. So, this is terminating decimal.

$\begin{array}{rl}\because \frac{987}{10500}& =\frac{47}{500}=\frac{47}{5^3\cdot 2^2}\times \frac{2}{2}\\ & =\frac{94}{5^3\times 2^3}=\frac{94}{(10{)}^3}=\frac{94}{1000}=0.094\end{array}$

Solution

327.7081 is terminating decimal number. So, it represents a rational number and also its denominator must have the form $2^m\times 5^n$.

$\begin{array}{rl}& \text{ Thus, }327.7081=\frac{3277081}{10000}=\frac{p}{q}\\ & \therefore q={10}^4=2\times 2\times 2\times 2\times 5\times 5\times 5\times 5\\ & =2^4\times 5^4=(2\times 5{)}^4\end{array}$

Hence, the prime factors of $q$ is 2 and 5 .

Thinking Process

Use Euclid’s division algorithm, put the value of divisor as 4 and then put the value of remainder from 0 to 3 and get the different form. Now, squaring every different form and get the required form.

Solution

Let a be an arbitrary positive integer. Then, by, Euclid’s division algorithm, corresponding to the positive integers $a$ and 4 , there exist non-negative integers $m$ and $r$, such that

$\Rightarrow$ $\begin{array}{rl}a& =4m+r,\text{ where }0\le r<4\\ a^2& =16m^2+r^2+8mr\end{array}$

where,

$0\le r<4$

Case I When $r=0$, then putting $r=0$ in Eq. (i), we get

$a^2=16m^2=4(4m^2)=4q$

$\text{ where, }q=4m^2\text{ is an integer. }$

Case II When $r=1$, then putting $r=1$ in Eq. (i), we get

$$\begin{array}{}\text{(i)}& [\because (a+b{)}^2=a^2+2ab+b^2]\end{array}$$

$$\begin{array}{rl}{a}^2& =16m^2+1+8m\\ & =4(4m^2+2m)+1=4q+1\end{array}$$

where, $q=(4m^2+2m)$ is an integer.

Case III When $r=2$, then putting $r=2$ in Eq. (i), we get

$$\begin{array}{rl}{a}^2& =16m^2+4+16m\\ & =4(4m^2+4m+1)=4q\end{array}$$

where, $q=(4m^2+4m+1)$ is an integer.

Case IV When $r=3$, then putting $r=3$ in Eq. (i), we get

$$\begin{array}{rl}{a}^2& =16m^2+9+24m=16m^2+24m+8+1\\ & =4(4m^2+6m+2)+1=4q+1\end{array}$$

where, $q=(4m^2+6m+2)$ is an integer.

Hence, the square of any positive integer is either of the form $4q$ or $4q+1$ for some integer $q$.

Thinking Process

Use Euclid’s division algorithm. Put the value of remainder from 0 to 3, get the different forms of any positive integer. Now cubing to every different form of positive integer and get the required forms.

Solution

Let a be an arbitrary positive integer. Then, by Euclid’s division algorithm, corresponding to the positive integers $a$ and 4 , there exist non-negative integers $q$ and $r$ such that

$\begin{array}{ll}& a=4q+r\text{, where }0\le r<4\\ \Rightarrow & a^3=(4q+r{)}^3=64q^3+r^3+12q{r}^2+48q^{2}r\\ & [\because (a+b{)}^3=a^3+b^3+3a{b}^2+3a^{2}b]\\ \Rightarrow & a^3=(64q^2+48q^{2}r+12q{r}^2)+r^3\\ & \text{ where, }0\le r<4\end{array}$

Case I When $r=0$,

Putting $r=0$ in Eq. (i), we get

$a^3=64q^3=4(16q^3)$

$\Rightarrow a^3+4m$ where $m=16q^3$ is an integer.

Case II When $r=1$, then putting $r=1$ in Eq. (i), we get

$\begin{array}{rl}{a}^3& =64q^3+48q^2+12q+1\\ & =4(16q^3+12q^2+3q)+1\\ & =4m+1\end{array}$

where, $m=(16q^2+12q^2+3q)$ is an integer.

Case III When $r=2$, then putting $r=2$ in Eq. (i), we get

$\begin{array}{rl}{a}^3& =64q^3+144q^2+108q+27\\ & =64q^3+144q^2+108q+24+3\\ & =4(16q^3+36q^2+27q+6)+3=4m+3\end{array}$

where, $m=(16q^3+36q^2+27q+6)$ is an integer.

Hence, the cube of any positive integer is of the form $4m,4m+1$ or $4m+3$ for some integer $m$.

Solution

Let a be an arbitrary positive integer.

Then, by Euclid’s divisions Algorithm, corresponding to the positive integers a and 5, there exist non-negative integers $m$ and $r$ such that

$\begin{array}{ll}\Rightarrow & a^2=(5m+r{)}^2=25m^2+r^2+10mr\\ & [\because (a+b{)}^2=a^2+2ab+b^2]\\ \Rightarrow & a^2=5(5m^2+2mr)+r^2\\ \text{ where, }& 0\le r<5\end{array}$

$a=5m+r\text{, where }0\le r<5$

Case I When $r=0$, then putting $r=0$ in Eq. (i), we get

$a^2=5(5m^2)=5q$

where, $q=5m^2$ is an integer.

Case II When $r=1$, then putting $r=1$ is Eq. (i), we get

$\begin{array}{ccc}\Rightarrow & a^2& =5(5m^2+2m)+1\\ & & q& =5q+1\end{array}$

where, $q=(5m^2+2m)$ is an integer.

Case III When $r=2$, then putting $r=2$ in Eq. (i), we get

$a^2=5(5m^2+4m)+4=5q+4$

where, $q=(5m^2+4m)$ is an integer.

Case IV When $r=3$, then putting $r=3$ in Eq. (i), we get

$\begin{array}{rl}{a}^2& =5(5m^2+6m)+9=5(5m^2+6m)+5+4\\ & =5(5m^2+6m+1)+4=5q+4\end{array}$

where, $q=(5m^2+6m+1)$ is an integer.

Case V When $r=4$, then putting $r=4$ in Eq. (i), we get

$\begin{array}{rl}& a^2=5(5m^2+8m)+16=5(5m^2+8m)+15+1\\ & \Rightarrow a^2=5(5m^2+8m+3)+1=5q+1\\ & \text{ where, }q=(5m^2+8m+3)\text{ is an integer. }\end{array}$

Hence, the square of any positive integer cannot be of the form $5q+2$ or $5q+3$ for any integer $q$.

Solution

Let a be an arbitrary positive integer, then by Euclid’s division algorithm, corresponding to the positive integers $a$ and 6 , there exist non-negative integers $q$ and $r$ such that

$$\begin{array}{}\text{(i)}& \begin{array}{ll}\Rightarrow & a^2=(6q+r{)}^2=36q^2+r^2+12qr\\ & [\because (a+b{)}^2=a^2+2ab+b^2]\\ \Rightarrow & a^2=6(6q^2+2qr)+r^2\\ \text{ where, }& 0\le r<6\end{array}\end{array}$$

Case I When $r=0$, then putting $r=0$ in Eq. (i), we get

$a^2=6(6q^2)=6m$

where, $m=6q^2$ is an integer.

Case II When $r=1$, then putting $r=1$ in Eq. (i), we get

$a^2=6(6q^2+2q)+1=6m+1$

where, $m=(6q^2+2q)$ is an integer.

Case III When $r=2$, then putting $r=2$ in Eq (i), we get

$a^2=6(6q^2+4q)+4=6m+4$

where, $m=(6q^2+4q)$ is an integer.

Case IV When $r=3$, then putting $r=3$ in Eq. (i), we get

$\begin{array}{rl}{a}^2& =6(6q^2+6q)+9\\ & =6(6q^2+6a)+6+3\\ \Rightarrow a^2& =6(6q^2+6q+1)+3=6m+3\end{array}$

where, $m=(6q+6q+1)$ is an integer.

Case V When $r=4$, then putting $r=4$ in Eq. (i), we get

$\begin{array}{rl}{a}^2& =6(6q^2+8q)+16\\ & =6(6q^2+8q)+12+4\\ \Rightarrow a^2& =6(6q^2+8q+2)+4=6m+4\end{array}$

where, $m=(6q^2+8q+2)$ is an integer.

Case VI When $r=5$, then putting $r=5$ in Eq. (i), we get

$\begin{array}{rl}{a}^2& =6(6q^2+10q)+25\\ & =6(6q^2+10q)+24+1\\ \Rightarrow a^2& =6(6q^2+10q+4)+1=6m+1\\ \text{ where, }m& =(6q^2+10q+1)\text{ is an integer. }\end{array}$

Hence, the square of any positive integer cannot be of the form $6m+2$ or $6m+5$ for any integer $m$.

Solution

By Euclid’s division algorithm, we have $a=bq+r$, where $0\le r<4$

On putting $b=4$ in Eq. (i), we get

$a=4q+r\text{, where }0\le r<4\text{ i.e., }r=0,1,2,3$

If $r=0\Rightarrow a=4q,4q$ is divisible by $2\Rightarrow 4q$ is even.

If $r=1\Rightarrow a=4q+1,(4q+1)$ is not divisible by 2 .

If $r=2\Rightarrow a=4q+2,2(2q+1)$ is divisible by $2\Rightarrow 2(2q+1)$ is even.

If $r=3\Rightarrow a=4q+3,(4q+3)$ is not divisible by 2 .

So, for any positive integer $q,(4q+1)$ and $(4q+3)$ are odd integers.

Now,

$a^2=(4q+1{)}^2=16q^2+1+8q=4(4q^2+2q)+1$

$[\because (a+b{)}^2=a^2+2ab+b^2]$

is a square which is of the form $4m+1$, where $m=(4q^2+2q)$ is an integer.

and $a^2=(4q+3{)}^2=16q^2+9+24q=4(4q^2+6q+2)+1$ is a square

$[\because (a+b{)}^2=a^2+2ab+b^2]$

which is of the form $4m+1$, where $m=(4q^2+6q+2)$ is an integer.

Hence, for some integer $m$, the square of any odd integer is of the form $4m+1$.

Solution

Let

$$\begin{array}{}\text{(i)}& a=n^2-1\end{array}$$

Given that, $n$ is an odd integer.

$\therefore n=1,3,5,\dots$

From Eq. (i), at $n=1,a=(1{)}^2-1=1-1=0$,

which is divisible by 8 .

From Eq. (i), at $n=3,a=(3{)}^2-1=9-1=8$,

which is divisible by 8 .

From Eq. (i), at $n=5,a=(5{)}^2-1=25-1=24=3\times 8$,

which is divisible by 8 .

From Eq. (i), at $n=7,a=(7{)}^2-1=49-1=48=6\times 8$,

which is divisible by 8 .

Hence, $(n^2-1)$ is divisible by 8 , where $n$ is an odd integer.

Alternate Method

We know that an odd integer $n$ is of the from $(4q+1)$ or $(4q+3)$ for some integer $q$.

Case I When $n=4q+1$

In this case, we have

$\begin{array}{rl}(n^2-1)& =(4q+1{)}^2-1\\ & =16q^2+1+8q-1\\ (a+b{)}^2& =[a^2+2ab+b^2]& \\ & =16q^2+8q=8q(2q+1)\\ & =16q^2+8q=8q(2q+1)\end{array}$

which is clearly, divisible by 8 .

Case II When $n=4q+3$

In this case, we have

$\begin{array}{rl}(n^2-1)& =(4q+3{)}^2-1\\ & =16q^2+9+24q-1[\because (a+b{)}^2=a^2+2ab+b^2]\\ & =16q^2+24q+8\\ & =8(2q^2+3q+1)\end{array}$

which is clearly divisible by 8 .

Hence, $(n^2-1)$ is divisible by 8 .

Thinking Process

Here we have to take any two consecutive odd positive integers. After that squaring and adding both the number and check it is even but not divisible by 4.

Solution

Let $x=2m+1$ and $y=2m+3$ are odd positive integers, for every positive integer $m$. Then,

$\begin{array}{rl}{x}^2+y^2& =(2m+1{)}^2+(2m+3{)}^2\\ & =4m^2+1+4m+4m^2+9+12m\\ & [\because (a+b{)}^2=a^2+2ab+b^2]\\ & =8m^2+16m+10=\text{ even }\\ & =2(4m^2+8m+5)\text{ or }4(2m^2+4m+2)+1\end{array}$

Hence, $x^2+y^2$ is even for every positive integer $m$ but not divisible by 4 .

Thinking Process

First we use Euclid’s division algorithm between two larger numbers any of three and get the HCF between these two. After that we take the third number and resulting HCF of two numbers and apply again Euclid’s division algorithm and get the required HCF.

Solution

Let $a=693,b=567$ and $c=441$

By Euclid’s division algorithms,

$$\begin{array}{}\text{(i)}& a=bq+r\end{array}$$

$[\because$ dividend $=$ divisor $\times$ quotient + remainder $]$

First we take, $a=693$ and $b=567$ and find their HCF.

$\begin{array}{rl}& 693=567\times 1+126\\ & 567=126\times 4+63\\ & 126=63\times 2+0\end{array}$

$\therefore HCF(693,567)=63$

Now, we take $c=441$ and say $d=63$, then find their HCF.

Again, using Euclid’s division algorithm,

$\begin{array}{rlrl}& & c& =dq+r\\ \Rightarrow & & 441& =63\times 7+0\\ \therefore & & HCF(693,567,441)& =63\end{array}$

Solution

Since, 1, 2 and 3 are the remainders of 1251, 9377 and 15628, respectively. Thus, after subtracting these remainders from the numbers.

We have the numbers, $1251-1=1250,9377-2=9375$ and $15628-3=15625$

which is divisible by the required number.

Now, required number $=$ HCF of 1250, 9375 and 15625 [for the largest number]

By Euclid’s division algorithm,

$$\begin{array}{}\text{(i)}& a=bq+r\end{array}$$

$[\because$ dividend $=$ divisor $\times$ quotient + remainder $]$

For largest number, put $a=15625$ and $b=9375$

$15625=9375\times 1+6250$

$\begin{array}{cccc}\Rightarrow & & 9375& =6250\times 1+3125\\ \Rightarrow & & 6250& =3125\times 2+0\\ \therefore & HCF(15625,9375)& =3125\end{array}$

Now, we take $c=1250$ and $d=3125$, then again using Euclid’s division algorithm,

$\begin{array}{rl}& \Rightarrow 3125=1250\times 2+625\\ & \Rightarrow 1250=625\times 2+0\\ & \therefore HCF(1250,9375,15625)=625\end{array}$

[from Eq. (i)]

Hence, 625 is the largest number which divides 1251,9377 and 15628 leaving remainder 1 , 2 and 3 , respectively.

Thinking Process

In this type of question, we use the contradiction method i.e., we assume given number is rational and at last we have to prove our asssumption is wrong, i.e., the number is irrational.

Solution

Let us suppose that $\sqrt{3}+\sqrt{5}$ is rational.

Let $\sqrt{3}+\sqrt{5}=a$, where $a$ is rational.

Therefore,

$\sqrt{3}=a-\sqrt{5}$

On squaring both sides, we get

$\Rightarrow 3=a^2+5-2a\sqrt{5}[\because (a-b{)}^2=a^2+b^2-2ab]$

$\Rightarrow$

$2a\sqrt{5}=a^2+2$

Therefore,

$\sqrt{5}=\frac{a^2+2}{2a}\text{ which is contradiction. }$

As the right hand side is rational number while $\sqrt{5}$ is irrational. Since, 3 and 5 are prime numbers. Hence, $\sqrt{3}+\sqrt{5}$ is irrational.

Solution

If any number ends with the digit 0 or 5 , it is always divisible by 5 .

If ${12}^n$ ends with the digit zero it must be divisible by 5 .

This is possible only if prime factorisation of ${12}^n$ contains the prime number 5 .

Now,

$12=2\times 2\times 3=2^2\times 3$

$\Rightarrow$ ${12}^n=(2^2\times 3{)}^n=2^{2n}\times 3^n$ [since, there is no term contains 5]

Hence, there is no value of $n\in N$ for which ${12}^n$ ends with digit zero or five.

Solution

We have to find the LCM of $40cm,42cm$ and $45cm$ to get the required minimum distance. For this,

$\begin{array}{rl}40& =2\times 2\times 2\times 5,\\ 42& =2\times 3\times 7\\ 45& =3\times 3\times 5\\ 45)& =2\times 3\times 5\times 2\times 2\times 3\times \\ & =30\times 12\times 7=210\times 12\\ & =2520\end{array}$

$\begin{array}{rl}& \text{ and }45=3\times 3\times 5\\ & \therefore LCM(40,42,45)=2\times 3\times 5\times 2\times 2\times 3\times 7\end{array}$

Minimum distance each should walk $2520cm$. So that, each can cover the same distance in complete steps.

Solution

Denominator of the rational number $\frac{257}{5000}$ is 5000 .

Now, factors of $5000=2\times 2\times 2\times 5\times 5\times 5\times 5=(2{)}^3\times (5{)}^4$, which is of the type $2^m\times 5^n$, where $m=3$ and $n=4$ are non-negative integers.

$\therefore$ Rational number $=\frac{257}{5000}=\frac{257}{2^3\times 5^4}\times \frac{2}{2}$

[since, multiplying numerator and denominater by 2 ]

$=\frac{514}{2^4\times 5^4}=\frac{514}{(10{)}^4}$

$=\frac{514}{10000}=0.0514$

Hence, which is the required decimal expansion of the rational $\frac{257}{5000}$ and it is also a terminating decimal number.

Solution

Let us suppose that $\sqrt{p}+\sqrt{q}$ is rational.

Again, let $\sqrt{p}+\sqrt{q}=a$, where $a$ is rational.

Therefore,

$\sqrt{q}=a-\sqrt{p}$

On squaring both sides, we get

$q=a^2+p-2a\sqrt{p}[\because (a-b{)}^2=a^2+b^2-2ab]$

Therefore, $\sqrt{p}=\frac{a^2+p-q}{2a}$, which is a contradiction as the right hand side is rational number while $\sqrt{p}$ is irrational, since $p$ and $q$ are prime numbers.

Hence, $\sqrt{p}+\sqrt{q}$ is irrational.

Solution

Let a be an arbitrary positive integer. Then, by Euclid’s division algorithm, corresponding to the positive integers ’ $a$ ’ and 6 , there exist non-negative integers $q$ and $r$ such that

$\Rightarrow a^3=(6q+r{)}^3=216q^3+r^3+3\cdot 6q\cdot r(6q+r)$

$\Rightarrow a^3=(216q^3+108q^{2}r+18q{r}^2)+r^3$

$[\because (a+b{)}^3=a^3+b^3+3ab(a+b)]$

where, $0\le r<6$

Case I When $r=0$, then putting $r=0$ in Eq. (i), we get

$a^3=216q^3=6(36q^3)=6m$

where, $m=36q^3$ is an integer.

Case II When $r=1$, then putting $r=1$ in Eq. (i), we get

$a^3=(216q^3+108q^3+18q)+1=6(36q^3+18q^3+3q)+1$

$\Rightarrow a^3=6m+1$, where $m=(36q^3+18q^3+3q)$ is an integer.

Case III When $r=2$, then putting $r=2$ in Eq. (i), we get

$\begin{array}{rl}{a}^3& =(216q^3+216q^2+72q)+8\\ a^3& =(216q^3+216q^2+72q+6)+2\\ \Rightarrow a^3& =6(36q^3+36q^2+12q+1)+2=6m+2\end{array}$

where, $m=(36q^2+36q^2+12q+1)$ is an integer.

Case IV When $r=3$, then putting $r=3$ in Eq. (i), we get

$\begin{array}{rl}& \begin{array}{rl}{a}^3& =(216q^3+324q^2+162q)+27=(216q^3+324q^2+162q+24)+3\\ & =6(36q^3+54q^2+27q+4)+3=6m+3\end{array}\\ & \text{ where, }m=(36q^2+54q^2+27q+4)\text{ is an integer. }\end{array}$

Case V When $r=4$, then putting $r=4$ in Eq. (i), we get