Use Euclid's division lemma to show that...

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 sho

Similar Questions

Explore conceptually related problems

Using Eulid's divison lemma, show that the square of any positive interger is either of the form 3m or ( 3m+1) for some integer m. |

Show that the square of any positive integer is either of the form 4q or 4q + 1 form some integer q

Show that the square of any positive integer is either of the form "4m" or "4m+1" for some integer "m.

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m,9m+1 or,9m+8 for some integer m .

Use Euclid's division lemma to show that the cube of any positive integer is of the form 9m ,9m+1 or 9m+8 .

Show that the square of any positive integer is of the form 3m or,3m+1 for some integer m

Show that the square of any positive integer cannot be of the form 6m+2 or 6m+5 for some integer q.

Proof that the square of any positive integer is of the form of 4m or 4m+1 for some integer m.

Show that the square of any positive integer cannot of the form 5q+2 or 5q+3 for some integer q.

Show that the square of any positive integer cannot be of the form 5m + 2 or 5m +3 for some integer m .