Math, asked by sharma3932, 1 year ago

use euclid's division algorithm to show the square of any positive integer is either of form 2m or 2M + 1 for some integer m

Answers

Answered by LitChori01

3

Answer:

The answer is 54.........

Answered by Anonymous

4

Step-by-step explanation:

hope it will helps you.......

Attachments:

Previous Question

Next Question

Similar questions

Math, 6 months ago

Divide rupees351 into two parts such that the ratio of the two parts is 2:7...

English, 6 months ago

Give the meanings of the following words as used in the passage (i) cultivate (2) wander (3) exchange (4) depends (5) frame...

Math, 6 months ago

What is the number of terms 32,28,24, 20 whose sum is 132. Explain the double answer...

Political Science, 1 year ago

Father Of Indian Cricket??

English, 1 year ago

what is color vision define it...

English, 1 year ago

save the environment in std 10...

Chemistry, 1 year ago

how does impurities affect the boiling point of liquid...

Political Science, 1 year ago

when was constitution of sourh africa implemented...