Ex 1.1, 4 - Use Euclid’s division lemma to show that square - Euclid's Division Algorithm - Proving

-lock-

Ex 1.1, 4 - Chapter 1 Class 10 Real Numbers - Part 3

Ex 1.1, 4 - Chapter 1 Class 10 Real Numbers - Part 2

-endlock-

Take a fresh quiz. Then take another.
Every attempt is a new AI-adaptive Teachoo quiz with 5 questions, selected from your answers, mistakes, and progress.
Remove Ads

Transcript

Ex 1.1 , 4 Use Euclid’s division lemma to show that the square of any positive integer is either of the form 3m or 3m+ 1 for some integer m. [Hint : Let x be any positive integer then it is of the form 3q, 3q+ 1 or 3q+ 2. Now square each of these and show that they can be rewritten in the form 3m or 3m+ 1.] As per Euclid’s Division Lemma If a and b are 2 positive integers, then a = bq + r where 0 ≤ r < b Let positive integer be a And b = 3 Hence a = 3q + r where ( 0 ≤ r < 3) r is an integer greater than or equal to 0 and less than 3 hence r can be either 0 , 1 or 2 Hence, square of any positive number can be expressed of the form 3m or 3m + 1 Hence proved

Davneet Singh's photo - Co-founder, Teachoo

Made by

Davneet Singh

Davneet Singh is an IIT Kanpur graduate and has been teaching for 16+ years. At Teachoo, he breaks down Maths, Science and Computer Science into simple steps so students understand concepts deeply and score with confidence.

Many students prefer Teachoo Black for a smooth, ad-free learning experience.