Question

17. Use Euclid's division algorithm to show that any positive odd integer is of the form 4q + 1
49 +3, where q is some integer THIS QUESTION IS FROM CH 1 OF MATHS SO PLEASE TELL ME IF I IS DELETED FROM OUR SYLLABUS OF 2020 BOARD EXAMS OR NOT​

Answer 1

Answer:

A lemma is a proven statement used for proving another statement. So, according to Euclid's Division Lemma, if we have two positive integers a and b, then there would be whole numbers q and r that satisfy the equation: a = bq + r, where 0 ≤ r < b. a is the dividend. b is the divisor.