Math, asked by gyanjis, 8 months ago

State euclid division lemma

Answers

Answered by nehav6085

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.

Step-by-step explanation:

plzz follow me

hope you like it mark me as brainlest

Answered by Anonymous

Answer:

Euclid's division lemma, states that for any two positive integers 'a' and 'b' we can find two whole numbers 'q' and 'r' such that a = b × q + r where 0 ≤ r < b. Euclid's division lemma can be used to find the highest common factor of any two positive integers and to show the common properties of numbers.

$<marquee direction= left>$

$<html> <head> <meta name="viewport"the content="width=device-width, initial-scale=1"> <style> Body{ background-color: pink; font-family: cursive; } .glow{ font-size: 100px; color: #fff; text-align: center; -webkit-animation: glow 1s ease-in-out infinite alternate; -moz-animation: glow 1s ease-in-out infinite alternate; animation: glow 1s ease-in-out infinite alternate; } @-webkit-keyframes glow{ from{ text-shadow: 0 0 10px #fff, 0 0 20px #fff, 0 0 30px #e60073, 0 0 40px #e60073, 0 0 50px #e60073, 0 0 60px #e60073, 0 0 70px #e60073; } } </style> </head> <body> <h1 class="glow">Follow Me and pikachu2440 in my following❤❤</h1> </body> </html>$

Previous Question

Next Question

State euclid division lemma ​

Answers

State euclid division lemma