Question

find hcf and lcm by Euclid's method 1. 35 and 15​

Answer 1

Answer:

Example: Show that any positive odd integer is of the form 4q + 1 or 4q + 3, where q is some integer. Solution: Let a is b be two positive integers in which a is greater than b. According to Euclids division algorithm; a and b can be expressed as a = bq + r, where q is quotient and r is remainder and 0

Answer 2

Answer:

Step-by-step explanation:

this question is deleted