Chapter no.1 Real Numbers
Today we are going to learn the most important content from chapter 1 of your Mathematics textbook .
So kindly note down the following terms while watching video from given link and also images .
Real Numbers:- The collection of rational numbers and irrational numbers are called Real numbers . It means all rational numbers and all irrational numbers are called Real numbers .
Now according to board exam the most important topic of this chapter i.e Euclid's division lemma.
Euclid was the name of mathematician and lemma means statement.
According to Euclid's Division Lemma if we have two positive integers a and b , then their exist unique integers q and r which satisfies the condition
a = bq + r ,
where 0 less than or equal to r less than b
here a = dividend , b = divisor, q = quotient and r = remainder
It means
dividend = divisor ×quotient + remainder
Now, Euclid's division algorithm :-
Euclid's division algorithm is the technique to compute the Highest common factor (HCF) of two given positive integers.
Algorithm:- An algorithm is the series of well defined steps which gives procedure for solving a type of problem and
Lemma :- A lemma is a proven statement used for proving another statement.
Euclid's division lemma and algorithm are so closely interlinked .
Now see the following image how to write lemma and how to find out HCF by using Euclid's division algorithm.
Euclid's Division Algorithm
Assignment ( Other examples for practice)
Today we are going to learn the most important content from chapter 1 of your Mathematics textbook .
So kindly note down the following terms while watching video from given link and also images .
Real Numbers:- The collection of rational numbers and irrational numbers are called Real numbers . It means all rational numbers and all irrational numbers are called Real numbers .
Now according to board exam the most important topic of this chapter i.e Euclid's division lemma.
Euclid was the name of mathematician and lemma means statement.
According to Euclid's Division Lemma if we have two positive integers a and b , then their exist unique integers q and r which satisfies the condition
a = bq + r ,
where 0 less than or equal to r less than b
here a = dividend , b = divisor, q = quotient and r = remainder
It means
dividend = divisor ×quotient + remainder
Now, Euclid's division algorithm :-
Euclid's division algorithm is the technique to compute the Highest common factor (HCF) of two given positive integers.
Algorithm:- An algorithm is the series of well defined steps which gives procedure for solving a type of problem and
Lemma :- A lemma is a proven statement used for proving another statement.
Euclid's division lemma and algorithm are so closely interlinked .
Now see the following image how to write lemma and how to find out HCF by using Euclid's division algorithm.
The video of Euclid's division algorithm and their examples are available in the following link
Euclid's Division Algorithm
Assignment ( Other examples for practice)
No comments:
Post a Comment