how to do euclid's division algorithm
Answers
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<title> Second Demo Web Page </title>
</head>
<body bgcolor="lavenderblush">
<!-- the tag above adds a background color to the web page -->
<h1 align="center"> Some tags illustrated </h1>
<h2> Image </h2>
<p> <!-- the alt attribute displays text if the image can't be displayed -->
<img src="wdog.jpg" alt="silly dog picture" width="200" height="200"> </p>
<h2> Anchor </h2>
<p> <!-- the   lets you enter a blank space -->
  To return to the first page go to
<a href="demopage1.html"> My first demo page </a> </p>
<h2> Horizontal Line </h2>
<p> <hr color="green" width=75%> </p>
<h2> Font </h2>
<p>   <font color="purple"> There are other attributes you can add to the font tag - such as
size and font </font> </p>
<h2> Bold or Strong, Underline and Italicize or emphasize</h2>
<p> The <strong> Best </strong> part about <u>HTML</u> is how quickly you can <em> create </em>
a web page </p>
<h2> break </h2>
<p> Use this tag when you want to go <br> to a new line without a <br> blank line in between the
text. Here is the how the <p> paragraph tag spacing works. </p>
<h2> table tags</h2>
<p>
<table border="1" width="60%">
<tr> <!-- first row -->
<td width="25%"> first cell </td>
<td witth="75%"> second cell </td>
</tr> <!-- end of the first row -->
<tr> <!-- second row -->
<td> third cell </td>
<td> fourth cell </td>
</tr> <!-- end of second row -->
</table> <!-- end of the table -->
</p>
</body>
</html>
Answer:
══════ •『 ♡』• ════════════ •『 ♡』• ══════
According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r < b.
The basis of the Euclidean division algorithm is Euclid’s division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. That means that on dividing both the integers a and b the remainder is zero.
Euclid’s Division Lemma
Let us now get into the working of this euclidian algorithm.
Euclid’s Division Lemma Algorithm
Consider two numbers 78 and 980 and we need to find the HCF of these numbers. To do this, we choose the largest integer first, i.e. 980 and then according to Euclid Division Lemma, a = bq + r where 0 ≤ r < b;
980 = 78 × 12 + 44
Now, here a = 980, b = 78, q = 12 and r = 44.
Now consider the divisor as 78 and the remainder 44 and apply the Euclid division lemma again.
78 = 44 × 1 + 34
Similarly, consider the divisor 44 and the remainder 34 and apply the Euclid division lemma to 44 and 34.
44 = 34 × 1 + 10
Following the same procedure again,
34 = 10 × 3 + 4
10 = 4 × 2 + 2
4 = 2 × 2 + 0
As we see that the remainder has become zero, therefore, proceeding further is not possible. Hence, the HCF is the divisor b left in the last step. We can conclude that the HCF of 980 and 78 is 2.
Let us try another example to find the HCF of two numbers 250 and 75. Here, the larger the integer is 250, therefore, by applying Euclid Division Lemma a = bq + r where 0 ≤ r < b, we have
a = 250 and b = 75
⇒ 250 = 75 × 3 + 25
By applying the Euclid’s Division Algorithm again we have,
75 = 25 × 3 + 0
As the remainder becomes zero, we cannot proceed further. According to the algorithm, in this case, the divisor is 25 and hence, the HCF of 250 and 75 is 25.
══════ •『 ♡』• ════════════ •『 ♡』• ══════
ƒσłłσω мε
♥♥♥GIVE THANKS = TAKE THANKS ♥♥♥