Hello Everyone,
Welcome to NVT STUDY
I teach you RD SHARMA class 10th math’s chapter 1 exercise 1.1 question number 4 Euclid’s division lemma. So, if you are learner, you can take benefits of RD Sharma solution course free.
I have covered various questions practically
• Rd Sharma exercise 1.1 question number 1 :-00:08
• Rd Sharma exercise 1.1 question number 2 :-04:10
• Rd Sharma exercise 1.1 question number 3 :-08:00
Please don’t Forget to Like, Share & Subscribe
• Yuotube:- / @nvtstudy6917
• Playlist:- / @nvtstudy6917
• Facebook:-https://www.facebook.com/profile.php?...
• Instagram:- / nagendraedcbak120
• Twitter:-https://twitter.com/nvtstudy774095?t=...
• LinkedIn: - / nagendra-yadav-395345224
• website:-https://www.nvtstudy.com/
In this video, I will explain Euclid’s division lemma, a=b*q + r. It tells us about divisibility of integers. It is quite easy to state and understand. It states that any positives integer a can be divided by any other positive integer b in such a way that it leaves remainder r that is smaller than b. This is nothing but the usual long division method. Euclid’s division lemma provides us a step- wise procedure to compute the HCF of two positive integers. This step-wise producer is known as Euclid’s algorithm. I explain the product of two consecutive positive integers is divisible by 2 and also the product of three consecutive positive integers is divisible by 6.
------------------------*-----------------------*----------------------*----------------------------*-----------------------*------------------------
Queries:-
#nvtstudy