Home
Class 12
MATHS
[" Jsing Euclid's division algorithm,fin...

[" Jsing Euclid's division algorithm,find the fire of "960" and "1575.],[" (i) "405" and "2520" (ii) "504" and "1188" (iii) "960" and "1575" ."],[" how that every positive integer is either even or odd."],[" A cherervent positive odd integer is of the form "(6m+1)" or "(6m+3)]

Promotional Banner

Similar Questions

Explore conceptually related problems

Show that every positive even integer is of the form 2q and every positive odd integer is of the form 2q +1 for some integer q.

Using Eulid's divison algorithm, find the HCF of (i) 405 and 2520 \ \ (ii) 504 and 1188\ \ (iii) 960 and 1575

Show that every positive even integer is of the form 2m and that every positive odd integer is of the form 2m+1 , where m is some integer.

Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q+1, where q is some integer.

Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q+1, where q is some integer.

Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q + 1, where q is some integer.

Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q + 1, where q is some integer.

Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q + 1, where q is some integer.

Show that every positive even integer is of the form 2q, and that every positive odd integer is of the form 2q+1 , where q is some integer.